Sciweavers

1350 search results - page 221 / 270
» Generalized Committed Choice
Sort
View
CHI
2006
ACM
16 years 7 days ago
Share and share alike: exploring the user interface affordances of file sharing
With the rapid growth of personal computer networks and the Internet, sharing files has become a central activity in computer use. The ways in which users control the what, how, a...
Stephen Voida, W. Keith Edwards, Mark W. Newman, R...
STOC
2007
ACM
105views Algorithms» more  STOC 2007»
16 years 4 days ago
Balanced allocations: the weighted case
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
Kunal Talwar, Udi Wieder
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 4 days ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 4 days ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 4 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking