Sciweavers

130 search results - page 14 / 26
» The Quantum Communication Complexity of Sampling
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
99
Voted
INFOCOM
2012
IEEE
12 years 12 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 2 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
AUSDM
2008
Springer
227views Data Mining» more  AUSDM 2008»
14 years 11 months ago
Exploratory Mining over Organisational Communications Data
Exploratory data mining is fundamental to fostering an appreciation of complex datasets. For large and continuously growing datasets, such as obtained by regular sampling of an or...
Alan Allwright, John F. Roddick
WISE
2005
Springer
15 years 3 months ago
Asynchronous Web Services Communication Patterns in Business Protocols
Asynchronous interactions are becoming more and more important in the realization of complex B2B Web applications, and Web services are at the moment the most innovative and well-e...
Marco Brambilla, Giuseppe Guglielmetti, Christina ...