2157 search results - page 70 / 432 » Optimal Fast Hashing |
128
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
127
Voted
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms ...
171
Voted
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
156
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
One key challenge in content-based image retrieval (CBIR) is to develop a fast solution for indexing high-dimensional image contents, which is crucial to building large-scale CBIR...
118
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Audio Fingerprints (AFP’s) are compact, content-based representations of audio signals used to measure distances among them. An AFP has to be small, fast computed and robust to ...