4524 search results - page 58 / 905 » The Complexity of Global Constraints |
SARA
2005
Springer
15 years 6 months ago
2005
Springer
This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
94
Voted
ICDAR
2009
IEEE
15 years 7 months ago
2009
IEEE
This article presents a global optimization approach to reconstruct surfaces from a single document image. Instead of assuming globally developable in previous works which restric...
105
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
113
click to vote
FOIKS
2004
Springer
15 years 4 months ago
2004
Springer
When two or more databases are combined into a global one, integrity may be violated even when each database is consistent with its own local integrity constraints. Efficient metho...
116
Voted
AAAI
2004
15 years 1 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...