9842 search results - page 229 / 1969 » The Complexity of the Matching-Cut Problem |
NECO
2002
15 years 5 days 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...
141
Voted
LICS
2012
IEEE
13 years 2 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...
86
Voted
ICIP
2000
IEEE
16 years 2 months 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...
97
Voted
ICRA
2003
IEEE
15 years 5 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...
120
click to vote
STACS
2009
Springer
15 years 7 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...