1056 search results - page 162 / 212 » Constraint-Based Graph Matching |
MICCAI
2010
Springer
14 years 2 months ago
2010
Springer
While there has been substantial progress in segmenting natural im-
ages, state-of-the-art methods that perform well in such tasks unfortunately tend
to underperform ...
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
GI
2004
Springer
14 years 2 months ago
2004
Springer
: We present our idea of solving parts of the vision task with an organic computing approach. We have designed a multiagent system (MAS) of many different modules working on differ...
ICANN
2009
Springer
14 years 1 months ago
2009
Springer
We present a neural system that recognizes faces under strong variations in pose and illumination. The generalization is learnt completely on the basis of examples of a subset of p...
ISSS
1999
IEEE
14 years 1 months ago
1999
IEEE
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...