2294 search results - page 41 / 459 » From Path Graphs to Directed Path Graphs |
133
click to vote
ICC
2007
IEEE
16 years 8 days ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
259
click to vote
GC
2011
Springer
15 years 28 days ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
169
click to vote
MICCAI
2010
Springer
15 years 4 months ago
2010
Springer
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
184
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
152
click to vote
COCOON
2001
Springer
15 years 10 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...