9842 search results - page 347 / 1969 » The Complexity of the Matching-Cut Problem |
160
click to vote
IEEEARES
2006
IEEE
15 years 10 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
123
click to vote
UC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
117
click to vote
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
147
click to vote
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
144
click to vote
ICPR
2002
IEEE
15 years 9 months ago
2002
IEEE
Detecting and recognizing face images automatically is a difficult task due to the variability of illumination, presentation angle, face expression and other common problems of m...