9842 search results - page 229 / 1969 » The Complexity of the Matching-Cut Problem |
NECO
2002
13 years 10 months ago
2002
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
LICS
2012
IEEE
12 years 1 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
ICIP
2000
IEEE
15 years 11 days ago
2000
IEEE
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...
ICRA
2003
IEEE
14 years 4 months ago
2003
IEEE
— Important theoretical aspects of multi-robot coordination mechanisms have, to date, been largely ignored. To address part of this negligence, we focus on the problem of multi-r...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...