2514 search results - page 106 / 503 » On the Computation of Approximations of Database Queries |
167
click to vote
ALGORITHMICA
2010
15 years 6 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...
181
click to vote
DIS
2006
Springer
15 years 10 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
167
click to vote
DEXA
2005
Springer
15 years 12 months ago
2005
Springer
Computing aggregates over distributed data sets constitutes an interesting class of distributed queries. Recent advances in peer-to-peer discovery of data sources and query process...
267
click to vote
JPDC
2007
15 years 6 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...
260
click to vote
ICDE
2005
IEEE
16 years 7 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...