Sciweavers

4816 search results - page 140 / 964
» Performance analysis of the AntNet algorithm
Sort
View
CORR
2010
Springer
172views Education» more  CORR 2010»
15 years 5 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
ICIAR
2010
Springer
15 years 9 months ago
Secure Iris Recognition Based on Local Intensity Variations
In this paper we propose a fast and efficient iris recognition algorithm which makes use of local intensity variations in iris textures. The presented system provides fully revocab...
Christian Rathgeb, Andreas Uhl
JCPHY
2011
192views more  JCPHY 2011»
14 years 8 months ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
CORR
2011
Springer
163views Education» more  CORR 2011»
15 years 1 days ago
Statistical Analysis of Link Scheduling on Long Paths
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...
Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Al...
150
Voted
INTERSPEECH
2010
14 years 12 months ago
Sparse component analysis for speech recognition in multi-speaker environment
Sparse Component Analysis is a relatively young technique that relies upon a representation of signal occupying only a small part of a larger space. Mixtures of sparse components ...
Afsaneh Asaei, Hervé Bourlard, Philip N. Ga...