Sciweavers

6365 search results - page 60 / 1273
» Fast Local Computation Algorithms
Sort
View
ICIAR
2010
Springer
15 years 5 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
TON
2008
125views more  TON 2008»
15 years 14 days ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ICRA
2006
IEEE
127views Robotics» more  ICRA 2006»
15 years 6 months ago
Consistency of the FastSLAM Algorithm
— This paper presents an analysis of FastSLAM— a Rao-Blackwellised particle filter formulation of simultaneous localisation and mapping. It shows that the algorithm degenerate...
Tim Bailey, Juan Nieto, Eduardo Mario Nebot
BMCBI
2006
145views more  BMCBI 2006»
15 years 19 days ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
CEC
2008
IEEE
15 years 7 months ago
A Fast Bacterial Swarming Algorithm for high-dimensional function optimization
—A novel Fast Bacterial Swarming Algorithm (FBSA) for high-dimensional function optimization is presented in this paper. The proposed algorithm combines the foraging mechanism of...
Ying Chu, Hua Mi, Huilian Liao, Zhen Ji, Q. H. Wu