Wavelet analysis have received significant attention because their multi-resolution decomposition allows efficient image analysis. It is widely used for varied applications such as noise reduction, and data compression, etc. In this paper we have introduced and applied the concept of 2 dimensional Gabor wavelet transform to Biometric Iris recognition system. The application of this transform in encoding the iris image for pattern recognition proves to achieve increased accuracy and processing speed compared to other methods. With a strong scien ....etc

[:=Read Full Message Here=:]

Hi everyone
I need java code for simulation of task scheduling based on ACO in cloud environment plz.
thanks ....etc

[:=Read Full Message Here=:]

developing an algorithm for data mining using clustering genetic algorithm at c++



With an enormous amount of data stored in databases and data warehouses, it is increasingly important to develop powerful tools for analysis of such data and mining interesting knowledge from it. Data mining is more than slicing and dicing of data; it is a powerful business intelligence technology that provides knowledge about unknown patterns and events from large databases. Data mining technologies have known to significantly reduce operational costs and ....etc

[:=Read Full Message Here=:]

I need simple Matlab Code for Adaptive Huffman Algorithm .

Thank You So much . ! ....etc

[:=Read Full Message Here=:]

This paper provides a heuristic algorithm for an NP-Complete problem. It is a result of a research on an NP-Complete problem known as Clique problem. I have succeeded in developing an algorithm which will give the maximum size Clique, for a given graph G, as its output. This paper explains the algorithm, its time complexity, applications and its implementation in C. This is a research paper based on an interesting class of problems known as ?NP-Complete? problems. No polynomial-time algorithm has yet been discovered for an NP-Complete problem, ....etc

[:=Read Full Message Here=:]

:heart:AN ALGORITHM FOR LABELING A TREE:heart:

KOH KHEE MENG AND TAY ENG GUAN

Abstract. An algorithm is described for labeling the vertices of a tree. A tree can then be determined by the collection of labels of its vertices, listed in lexicographic order.


1. Introduction

The notion of distance degree sequences of graphs was studied by Randic for the purpose of distinguishing chemical isomers by their graph structures. Other sequences for this purpose have also been proposed and discussed. The objective and hope is to deve ....etc

[:=Read Full Message Here=:]

I want help in developing code for implementation of bankers algorithm and new request algorithm in java with GUI ....etc

[:=Read Full Message Here=:]

how to implement and simulate vfa in matlab? Can we get some help in code. ....etc

[:=Read Full Message Here=:]

The problem of factoring a large number into the constituent primes is a time old one and many a scientists have dedicated their time and effort for developing a compact and efficient factoring algorithm. The RSA encryption algorithm developed by Rivest, Shamir and Adelman based on primality testing and prime factoring is one of the best encryption algorithms in use today.
Here we discuss some of the recent developments in the field of primality testing and also a comparison study with the primality testing algorithm of the IIT?ians is also gi ....etc

[:=Read Full Message Here=:]

i wani aco job scheduling algorthem using aco ....etc

[:=Read Full Message Here=:]