91 search results - page 3 / 19 » Most Cited Paper Award |
100
click to vote
STOC
2010
ACM
15 years 5 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...
131
click to vote
GRAPHICSINTERFACE
2008
15 years 2 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...
111
click to vote
STOC
2009
ACM
16 years 2 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...
117
click to vote
IMC
2004
ACM
15 years 7 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...
129
click to vote
STOC
2010
ACM
15 years 6 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...