909 search results - page 87 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
111
click to vote
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
111
click to vote
ALENEX
2007
15 years 2 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
124
click to vote
ICDM
2010
IEEE
14 years 11 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
117
click to vote
IMAMS
2003
15 years 2 months ago
2003
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
109
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...