COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
ICDCS
2007
IEEE
2007
IEEE
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
13 years 11 months ago
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...