429 search results - page 33 / 86 » Query Planning for Continuous Aggregation Queries over a Net... |
119
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
145
click to vote
RTCSA
2009
IEEE
15 years 11 months ago
2009
IEEE
—Mobile sensors are widely deployed in Wireless Sensor Networks (WSNs) to satisfy emerging application requirements. Specifically, processing location dependent queries in mobile...
180
click to vote
PVLDB
2008
15 years 3 months ago
2008
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
172
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
207
Voted
SSD
2007
Springer
15 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...