9842 search results - page 307 / 1969 » The Complexity of the Matching-Cut Problem |
131
click to vote
STACS
2001
Springer
15 years 8 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
120
click to vote
KBS
2007
15 years 3 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
125
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
We propose an information-theoretic method for multi-phase image segmentation, in an active contour-based framework. Our approach is based on nonparametric density estimates, and ...
120
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
We consider the estimation of an unknown arbitrary 2D object shape from sparse noisy samples of its Fourier transform. The estimate of the closed boundarycurve is parametrized by ...
119
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Due to relative motion between the transmitter and the receiver, the carrier of the received signal in digital burstmode transmission can be affected by Doppler distortion. Thi...