1327 search results - page 62 / 266 » Path following algorithm for the graph matching problem |
112
click to vote
ISAAC
1998
Springer
15 years 6 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
124
click to vote
WALCOM
2010
IEEE
15 years 2 days ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
101
click to vote
EDBT
2008
ACM
16 years 1 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
101
click to vote
WSDM
2009
ACM
15 years 8 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
148
click to vote
PAMI
2007
15 years 1 months ago
2007
—This paper presents a new affine-invariant matching algorithm based on B-Spline modeling, which solves the problem of the nonuniqueness of B-Spline in curve matching. This metho...