337 search results - page 59 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
JMLR
2010
13 years 7 months ago
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
WDAG
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
ICALP
2011
Springer
13 years 19 days ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper introduces an algorithm for detecting walking
motion using point trajectories in video sequences. Given
a number of point trajectories, we identify those which are
sp...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...