91 search results - page 3 / 19 » Most Cited Paper Award |
STOC
2010
ACM
15 years 1 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
110
click to vote
GRAPHICSINTERFACE
2008
14 years 11 months ago
2008
Large high-resolution displays have been shown to improve user performance over standard displays on many large-scale visualization tasks. But what is the reason for the improveme...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
IMC
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we study the live streaming workload from a large content delivery network. Our data, collected over a 3 month period, contains over 70 million requests for 5,000 d...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...