237 search results - page 5 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
CCCG
2008
13 years 9 months ago
2008
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear...
COMPGEOM
1997
ACM
14 years 1 days ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...