5592 search results - page 130 / 1119 » On Random Betweenness Constraints |
AAAI
2004
13 years 11 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
COMBINATORICS
2000
13 years 10 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...
CSCLP
2004
Springer
14 years 3 months ago
2004
Springer
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge deco...
ICDAR
2005
IEEE
14 years 3 months ago
2005
IEEE
Many diagrams contain compound objects composed of parts. We propose a recognition framework that learns parts in an unsupervised way, and requires training labels only for compou...