1888 search results - page 217 / 378 » Algorithms for Querying by Spatial Structure |
212
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
140
click to vote
DEBU
2010
15 years 1 months ago
2010
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
172
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
125
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
125
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...