213 search results - page 16 / 43 » Counting Independent Sets Using the Bethe Approximation |
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
138
click to vote
IPCO
2001
15 years 1 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
71
Voted
CONSTRAINTS
2007
14 years 11 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
129
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
The bag-of-words (BoW) model treats images as an unordered set of local regions and represents them by visual word histograms. Implicitly, regions are assumed to be identically an...
118
Voted
UAI
2008
15 years 1 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...