17 search results - page 1 / 4 » Tradeoffs in Approximate Range Searching Made Simpler |
SIBGRAPI
2008
IEEE
13 years 11 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
SIGIR
2012
ACM
11 years 7 months ago
2012
ACM
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
CCR
2006
13 years 4 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...