154 search results - page 29 / 31 » On Boosting with Polynomially Bounded Distributions |
144
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
256
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
136
click to vote
STOC
2009
ACM
16 years 4 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...
134
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
142
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...