162 search results - page 4 / 33 » Structural Matching Via Optimal Basis Graphs |
PVLDB
2010
13 years 9 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
One of the main factors driving object-oriented software development for information systems is the requirement for systems to be tolerant to change. To address this issue in desig...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...