668 search results - page 64 / 134 » Algorithmics and Applications of Tree and Graph Searching |
105
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
120
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
133
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
We explore the application of a graph representation to model similarity relationships that exist among images found on the Web. The resulting similarity-induced graph allows us t...
105
click to vote
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
141
Voted
WEA
2010
Springer
15 years 9 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...