Sciweavers

1040 search results - page 200 / 208
» A Distributed Algorithm for Joins in Sensor Networks
Sort
View
GLOBECOM
2009
IEEE
14 years 2 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
SIGMOD
2006
ACM
219views Database» more  SIGMOD 2006»
14 years 7 months ago
Modeling skew in data streams
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
Flip Korn, S. Muthukrishnan, Yihua Wu
DAIS
2009
13 years 8 months ago
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed a...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
ICASSP
2011
IEEE
12 years 11 months ago
Entropy estimation using the principle of maximum entropy
In this paper, we present a novel entropy estimator for a given set of samples drawn from an unknown probability density function (PDF). Counter to other entropy estimators, the e...
Behrouz Behmardi, Raviv Raich, Alfred O. Hero