4198 search results - page 211 / 840 » In search of lost time |
236
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
241
click to vote
PODS
1997
ACM
15 years 10 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
174
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
171
click to vote
DEXA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
189
click to vote
AAAI
2007
15 years 9 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...