Sciweavers

1154 search results - page 45 / 231
» On the editing distance of graphs
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
An approach for video cut detection using bipartite graph matching as dissimilarity distance
The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the...
Silvio Jamil Ferzoli Guimarães, Zenilton Kl...
AUSAI
2009
Springer
14 years 3 months ago
A Graph Distance Based Structural Clustering Approach for Networks
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
Xin Su, Chunping Li
COMPLEX
2009
Springer
14 years 20 days ago
Capturing Internet Traffic Dynamics through Graph Distances
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
Steve Uhlig, Bingjie Fu, Almerima Jamakovic
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 8 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
14 years 2 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan