335 search results - page 29 / 67 » How to Use Spanning Trees to Navigate in Graphs |
150
click to vote
IJCV
2007
15 years 6 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
170
click to vote
PPOPP
2009
ACM
16 years 6 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
178
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
151
click to vote
IADIS
2008
15 years 7 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
162
click to vote
EDBT
2000
ACM
15 years 9 months ago
2000
ACM
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...