In the age of multimedia and high-speed networks, multicast is one of the mechanisms by which the power of the Internet can be further harnessed in an efficient manner. It has been increasingly used by various continuous media applications such as teleconferencing, distance learning, and voice & video transmission. Compared with unicast and broadcast, multicast can save network bandwidth and make transmission more efficient. In this seminars, we will review the history of the multicast, present you several existing multicast routing algorithms ....etc

[:=Read Full Message Here=:]

Mesh Algorithms in Parallel Processing

¢ Parallel processing is processing a task with several processing units, or many processors

¢ Most powerful computers contain two or more processing units that share among themselves the jobs submitted for processing

¢ Several operations are performed simultaneously, so the time taken by a computation can be reduced.

¢ A problem to be solved is broken into a no.of subproblems. These subproblems are now solved simultaneously, each on different processors. The results are then combi ....etc

[:=Read Full Message Here=:]

In this technical paper we present a study of the various routing algorithms, which are in use presently. This study of present algorithms is limited to their general working and the various security problems, which they are unable to solve. Our main emphasis is on discussing a novel approach based on Leap-Frog cryptographic signing protocol and that how this novel approach deals the various security threats, which, its predecessors (using traditional public-key signature schemes) are unable to withstand.

Download Full Seminar Report
[size ....etc

[:=Read Full Message Here=:]

A Low-Complexity SISO Multiuser Detector for Iterative Decoding of Asynchronous CDMA Systems With Convolutional Codes
Abstract”
The optimal decoding scheme for asynchronous codedivision multiple-access (CDMA) systems that employ convolutional codes results in a prohibitive computational complexity. To reduce the computational complexity, an iterative receiver structure was proposed for decoding multiuser data in a convolutional coded CDMA system. At each iteration, extrinsic information is exchanged between a soft-input soft-output (S ....etc

[:=Read Full Message Here=:]

Hi ,

I am doing a project Low complexity Iris coding and recognition based on directionlets using MATLAB. Assist me in getting the codes for this project.

Thanks

Sam ....etc

[:=Read Full Message Here=:]

LOW COMPLEXITY IRIS CODING AND VERIFICATION


OBJECTIVE
The objective of our project is to provide authentication based on iris recognition. A novel iris recognition method is presented. In the method, the iris features are extracted using the oriented separable wavelet transforms (directionlets) and they are compared in terms of a weighted Hamming distance. The feature extraction and comparison are shift-, size- and rotation-invariant to the ....etc

[:=Read Full Message Here=:]

seminar report on time complexity of a c program ....etc

[:=Read Full Message Here=:]

When reference signal for the FxLMS algorithm is taken from an acoustic sensor convergence can be very slow due to great eigen value spread. Using a non acoustic sensor, Such as a tachometer, cancellation of narrow band noise in the sensed fundamental frequency and harmonically related ones can be achieved very fast, although other periodic noises and underline broad band noise will remain.

Backward prediction errors resulting at the various stages of an adaptive lattice predictor(ALP) represent a a time-domain orthogonalization of the input ....etc

[:=Read Full Message Here=:]

When reference signal for the FxLMS algorithm is taken from an acoustic sensor convergence can be very slow due to great eigen value spread. Using a non acoustic sensor, Such as a tachometer, cancellation of narrow band noise in the sensed fundamental frequency and harmonically related ones can be achieved very fast, although other periodic noises and underline broad band noise will remain.




Backward prediction errors resulting at the various stages of an adaptive lattice predictor(ALP) represent a a time-domain orthogonalization of ....etc

[:=Read Full Message Here=:]

Seminar
On
RANDOMIZED ALGORITHMS
Prepared by
Shamseena K
S1 M.Tech
Software Engineering
CUSATPage 2

Seminar Report-2005
Randomized Algorithms
Department of Computer Science
CUSAT
2
ABSTRACT
A randomized algorithm is defined as an algorithm that typically uses the random
bits as an auxiliary input to guide its behavior. It achievs good performance in the
average case. Formally, the algorithm's performance will be a random variable
determined by the random bits, with (hopefully) good expected value. The worst case is
typi ....etc

[:=Read Full Message Here=:]