868 search results - page 90 / 174 » A general compression algorithm that supports fast searching |
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
GECCO
2006
Springer
14 years 22 days ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
COMPGEOM
2005
ACM
13 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
FOCS
1993
IEEE
14 years 1 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...