1206 search results - page 128 / 242 » Arc-Flags in Dynamic Graphs |
133
click to vote
SIROCCO
1998
15 years 5 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
172
click to vote
TVCG
2008
15 years 3 months ago
2008
Systems biologists use interaction graphs to model the behavior of biological systems at the molecular level. In an iterative process, such biologists observe the reactions of livi...
115
click to vote
USITS
2003
15 years 5 months ago
2003
straction. TESLA services can be deployed transparently using dynamic library interposition and can be composed by chaining event handlers in a graph structure. We show how TESLA c...
147
click to vote
DAM
2007
15 years 4 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
167
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...