151 search results - page 21 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
145
Voted
PODS
2005
ACM
16 years 4 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
147
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
118
Voted
ICCAD
2003
IEEE
16 years 24 days ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
129
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
142
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...