Sciweavers

16430 search results - page 54 / 3286
» On Computable Tree Functions
Sort
View
SODA
2000
ACM
148views Algorithms» more  SODA 2000»
13 years 11 months ago
Computing contour trees in all dimensions
We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...
Hamish Carr, Jack Snoeyink, Ulrike Axen
IJCAI
2007
13 years 11 months ago
Inside-Outside Probability Computation for Belief Propagation
In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be...
Taisuke Sato
CCGRID
2003
IEEE
14 years 3 months ago
RelayCast: A Middleware for Application-level Multicast Services
Application-level multicast (ALM) is being increasingly recognized as a solution to support multipoint applications without the need for a network layer multicast protocol. Though...
Nodoka Mimura, Kiyohide Nakauchi, Hiroyuki Morikaw...
RSA
2010
106views more  RSA 2010»
13 years 4 months ago
Thermodynamic limit for large random trees
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
Yuri Bakhtin
BMCBI
2006
150views more  BMCBI 2006»
13 years 10 months ago
TreeDyn: towards dynamic graphics and annotations for analyses of trees
Background: Analyses of biomolecules for biodiversity, phylogeny or structure/function studies often use graphical tree representations. Many powerful tree editors are now availab...
François Chevenet, Christine Brun, Anne-Lau...