2695 search results - page 372 / 539 » Learning Graph Matching |
130
click to vote
PKDD
2005
Springer
15 years 8 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...
146
click to vote
GI
2004
Springer
15 years 8 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...
135
click to vote
ISSS
1999
IEEE
15 years 7 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...
HPDC
1998
IEEE
15 years 7 months ago
1998
IEEE
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to...
122
click to vote
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...