337 search results - page 15 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
116
Voted
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
113
Voted
ICST
2010
IEEE
14 years 9 months ago
2010
IEEE
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
144
Voted
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
121
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
113
click to vote
ALGORITHMICA
2008
14 years 11 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...