1977 search results - page 22 / 396 » The satisfactory partition problem |
156
click to vote
AAIM
2007
Springer
15 years 12 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
192
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
184
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...
134
click to vote
GD
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
189
click to vote
CDC
2010
IEEE
15 years 23 days ago
2010
IEEE
Abstract-- This paper deals with the problems of decentralized implementability and decentralized regular implementability in the context of finite-dimensional linear differential ...