In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices, nodes, or points which are connected by edges, arcs, or lines. A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or its edges may be directed from one vertex to another; see Graph (discrete mathematics) for more detailed definitions and for other variations in the types of grap ....etc

[:=Read Full Message Here=:]

i want advantages of robust face name graph mathcing for movie character identification
advantages of robust face name graph for moving character identification ....etc

[:=Read Full Message Here=:]

ERROR CONTROL CODING



W hen a digital signal is transmitted between two systems(such as computers),the signal gets distorted because of addition of noise to the transmitted signal. The noise can introduce an error in the binary train of bit travelling from one system to the other .this means that a 0 may change to 1 or a 1 may change to 0.These error can become a serious problem to the accuracy and performance of the digital system. Therefore it is essential to detect and correct the er ....etc

[:=Read Full Message Here=:]

HAMMING CODE GENERATION AND ERROR DETECTING AND CORRECTING



INTRODUCTION:

In this lab we will review the steps to create and compile a project on programmable logic using ISE and we will introduce the required steps to download the project into a chip. The programmable device you are you going to use is the Coolrunner CPLD. In front of you is a black plastic board with two circuit boards on it. There should be labels. One should say FPGA and the other CPLD. We are goi ....etc

[:=Read Full Message Here=:]

ERROR CONTROL CODING



Basic Concepts

Received: 011. What was transmitted?
scenario A: 111 with one error in 1st location
scenario B: 000 with two errors in 2nd & 3rd locations.

Hamming Distance

Def.: The Hamming distance between two codewords ci and cj, denoted by d(ci,cj), is the number of components at which they differ.

Maximum Likelihood Decoding reduces to Minimum Distance Decoding, if the priory probabilities are equal (P(0)=P(1))

Error Correction an ....etc

[:=Read Full Message Here=:]

Abstract
We present matrix network coding methods that are
naturally amenable to a distributed implementation method, i.e.,
do not require the knowledge of network topology, and that are
suitable for network error correction. First, the Singleton bound
can be K-fold increased by employing a K K matrix coefficient.
Moreover, we prove that matrix network coding outperforms
linear network coding, since it corrects more errors than linear
network coding, while the amount of header overhead per packet
can be kept the same by reducin ....etc

[:=Read Full Message Here=:]

introduction
Our goal is to recognize individuals from the individual images by clicking on the Gallery, which also lists only one image per person. Our task is to deal with changing the image of the differences in the expression of the face, head pose, position and size (to name only the most important). Our task, therefore, is a typical discrimination-in-presence-variance problem, where it is necessary to try to minimize dispersion and stress the discriminatory features. This is normally only possible by using information about the structure ....etc

[:=Read Full Message Here=:]

LINEAR BLOCK CODE AS ERROR CONTROL CODING

PRESENTED BY:
NAME: DEBIKA DEY
SILIGURI INSTITUTE OF TECHNOLOGY

OVERVIEW:

SIMPLIFIED MODEL OF DIGITAL COMMUNICATION SYSTEM.
ERROR CONTROL CODING.
CLASSIFICATION OF ECC.
BLOCK CODES.
HAMMING CODE.
HAMMING DISTANCE & HAMMING WEIGHT.
PROPERTIES OF LBC.
GENERATOR MATRIX.
PARITY CHECK MATRIX.
RELATION BETWEEN G & H & C
DECODING OF A LINEAR CODE.
SYNDROME DECODING.
APPLICATION.
ADVANTAGES & DISADVANTAGES.


Simplified Model of Digital ....etc

[:=Read Full Message Here=:]

presented by:
Rahul Kala

Abstract
Graphs find a variety of use in numerous domains especially because of their capability to model common problems. The social networking graphs that are used for social networking analysis, a feature given by various social networking sites are an example of this. Graphs can also be visualized in the search engines to carry search operations and provide results. Various searching algorithms have been developed for searching in graphs. In this paper we propose that the entire network graph be ....etc

[:=Read Full Message Here=:]

plz give the details download seminar ppt of robust face name graph matching for movie character identification ? ....etc

[:=Read Full Message Here=:]