Sciweavers

455 search results - page 18 / 91
» On Trees and Noncrossing Partitions
Sort
View
ACTA
2008
88views more  ACTA 2008»
13 years 6 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
FOIKS
2008
Springer
13 years 9 months ago
SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach
This paper investigates an extension of classification trees to deal with uncertain information where uncertainty is encoded in possibility theory framework. Class labels in data s...
Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zi...
RECOMB
1997
Springer
13 years 12 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 9 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
EMNLP
2007
13 years 9 months ago
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...