337 search results - page 21 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
JGAA
2007
13 years 7 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
FOCS
2008
IEEE
14 years 2 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...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
DCOSS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...