3208 search results - page 124 / 642 » A Lower Bound for Primality |
158
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
211
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
171
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
179
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
164
click to vote
IJCAI
2007
15 years 7 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...