130 search results - page 14 / 26 » Binary Representations for General CSPs |
JMLR
2010
13 years 3 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
AGP
1998
IEEE
14 years 1 months ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
ALGORITHMICA
1999
13 years 8 months ago
1999
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
ISMVL
2002
IEEE
14 years 1 months ago
2002
IEEE
Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider ways to improve the construction of multiple-value...