89 search results - page 11 / 18 » Fast Algorithm for Nearest Neighbor Search Based on a Lower ... |
ICALP
2001
Springer
14 years 11 days ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
We develop a set of new motion estimation (ME) algorithms based mainly on Unsymmetric-Cross Multi-Hexagon-Grid Search (UMH). The original algorithms are improved by applying the S...