ESCAPE
2007
Springer
14 years 3 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
We propose two new data stream models: the reset model and the delta model, motivated by applications to databases, and to tracking the location of spatial points. We present algor...
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
ESCAPE
2007
Springer
14 years 5 months ago
2007
Springer
