Sciweavers

179 search results - page 10 / 36
» An Optimal Decomposition Algorithm for Tree Edit Distance
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
RECOMB
2005
Springer
15 years 9 months ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu
95
Voted
ISITA
2010
14 years 7 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
92
Voted
BIBE
2006
IEEE
132views Bioinformatics» more  BIBE 2006»
15 years 3 months ago
Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments
Ribonucleic acid (RNA) molecules contain the genetic information that regulates the functions of organisms. Given two different molecules, a preserved function corresponds to a pr...
Rimon Mikhaiel, Guohui Lin, Eleni Stroulia
81
Voted
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
15 years 9 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...