921 search results - page 110 / 185 » New Data Structures for Orthogonal Range Searching |
136
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
139
click to vote
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
Modern computer systems are based on the traditional hierarchical file system model, but typically contain large numbers of files with complex interrelationships. This tradition...
128
click to vote
ASPLOS
2000
ACM
15 years 8 months ago
2000
ACM
By studying the behavior of programs in the SPECint95 suite we observed that six out of eight programs exhibit a new kind of value locality, the frequent value locality, according...
171
click to vote
SIGIR
2012
ACM
13 years 6 months ago
2012
ACM
During a three-day workshop in February 2012, 45 Information Retrieval researchers met to discuss long-range challenges and opportunities within the field. The result of the works...
139
click to vote
WEBDB
2005
Springer
15 years 9 months ago
2005
Springer
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...