921 search results - page 51 / 185 » New Data Structures for Orthogonal Range Searching |
220
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
123
Voted
JEA
2008
15 years 3 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
122
click to vote
CLEF
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We design and validate simulators for generating queries and relevance judgments for retrieval system evaluation. We develop a simulation framework that incorporates exis...
154
click to vote
ICMCS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
145
click to vote
IJCAI
2001
15 years 5 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...