FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...