129
click to vote
FOCS
15 years 8 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 ...
156
click to vote
FOCS
15 years 8 months ago
2009 IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
131
click to vote
FOCS
15 years 5 months ago
2009 IEEE 
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
108
click to vote
FOCS
15 years 8 months ago
2009 IEEE 
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
113
click to vote
FOCS
15 years 8 months ago
2009 IEEE 
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
|
Theoretical Computer Science