Sciweavers

316 search results - page 59 / 64
» Top-K aggregation queries over large networks
Sort
View
IPSN
2010
Springer
15 years 4 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
ICDCS
2007
IEEE
15 years 1 months ago
Communication-Efficient Tracking of Distributed Cumulative Triggers
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
Ling Huang, Minos N. Garofalakis, Anthony D. Josep...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
TPDS
1998
112views more  TPDS 1998»
14 years 9 months ago
Parallel Computation in Biological Sequence Analysis
—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These data...
Tieng K. Yap, Ophir Frieder, Robert L. Martino
ICNP
2007
IEEE
15 years 4 months ago
Inferring the Origin of Routing Changes using Link Weights
— The global Internet routing infrastructure is a large and complex distributed system where routing changes occur constantly. Our objective in this paper is to develop a simple ...
Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lix...