237 search results - page 37 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
RT
2005
Springer
14 years 2 months ago
2005
Springer
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
SIGMOD
1998
ACM
14 years 1 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
BTW
2007
Springer
14 years 1 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...