1378 search results - page 50 / 276 » The Tractability of Global Constraints |
168
click to vote
ICML
2009
IEEE
16 years 7 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 ...
167
click to vote
FOIKS
2004
Springer
15 years 9 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...
176
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
168
click to vote
ICRA
2009
IEEE
16 years 23 days ago
2009
IEEE
Abstract— We incorporate sampling-based global path planning with Visual Servoing (VS) for a robotic arm equipped with an in-hand camera. The path planning accounts for a number ...
151
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...