1301 search results - page 72 / 261 » Bounded Version Vectors |
140
click to vote
STOC
1997
ACM
15 years 9 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
182
click to vote
SODA
2010
ACM
15 years 3 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
179
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
221
click to vote
SAGA
2009
Springer
16 years 1 days ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
156
click to vote
COLT
1999
Springer
15 years 9 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...