2410 search results - page 168 / 482 » Multiset Ordering Constraints |
160
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
258
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
180
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
146
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In this paper, we propose a simple and efficient twostage list synchronizer for frame synchronization of Low-Density Parity-Check (LDPC) coded data transmitted over the...
168
click to vote
RTAS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...