Sciweavers

4843 search results - page 432 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 5 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
PODS
2009
ACM
110views Database» more  PODS 2009»
16 years 5 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 2 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
ICDCS
2009
IEEE
15 years 11 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li
INFOCOM
2009
IEEE
15 years 11 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa