26 search results - page 1 / 6 » Approximate Range Searching: The Absolute Model |
WADS
2007
Springer
13 years 10 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 ε >...
STOC
2001
ACM
14 years 4 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
JAIR
2011
12 years 11 months ago
2011
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
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...