518 search results - page 24 / 104 » Beating a Random Assignment |
STACS
2004
Springer
15 years 5 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
106
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. We formulate the problem of finding co...
TIT
2008
14 years 11 months ago
2008
In this paper, we focus on the general relay channel. We investigate the application of the estimate-and-forward (EAF) relaying scheme to different scenarios. Specifically, we stud...
EMMCVPR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...