921 search results - page 78 / 185 » New Data Structures for Orthogonal Range Searching |
159
click to vote
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
137
click to vote
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
195
Voted
JMLR
2012
13 years 6 months ago
2012
This paper studies issues relating to the parameterization of probability distributions over binary data sets. Several such parameterizations of models for binary data are known, ...
141
click to vote
SARA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
174
click to vote
MMM
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...