1951 search results - page 107 / 391 » An algorithm for improving graph partitions |
143
click to vote
ICAPR
2005
Springer
15 years 10 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
142
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
144
click to vote
ASAP
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we propose a hardware/software partitioning method for improving applications’ performance in embedded systems. Critical software parts are accelerated on hardwar...
159
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
132
click to vote
FLAIRS
2004
15 years 5 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...