33 search results - page 3 / 7 » Graph Matching using Adjacency Matrix Markov Chains |
ALGORITHMICA
2008
13 years 7 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
IMAMS
2003
13 years 9 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...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we propose a simple framework to characterize the switching behavior between search engines based on click streams. We segment users into a number of categories bas...
ISAAC
1998
Springer
13 years 12 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...