114 search results - page 6 / 23 » Dynamic Spatial Approximation Trees for Massive Data |
TKDE
1998
13 years 7 months ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
CGF
2010
13 years 7 months ago
2010
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...