154 search results - page 22 / 31 » On Boosting with Polynomially Bounded Distributions |
133
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
126
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
146
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
148
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
128
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...