182 search results - page 17 / 37 » Approximate Colored Range Queries |
JPDC
2007
13 years 8 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper we introduce the idea of snapshot queries for energy efficient data acquisition in sensor networks. Network nodes generate models of their surrounding environment th...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
ALGORITHMICA
2010
13 years 8 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...