217 search results - page 14 / 44 » On the Fine Structure of Large Search Spaces |
166
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
225
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
173
click to vote
SIGIR
2006
ACM
16 years 13 hour ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
186
click to vote
ADBIS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
145
click to vote
CI
1998
15 years 5 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....