Sciweavers

105 search results - page 5 / 21
» Representing Trees of Higher Degree
Sort
View
89
Voted
FOIKS
2008
Springer
15 years 1 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...
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 11 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 1 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
Panagiotis Karras, Nikos Mamoulis
BMCBI
2010
143views more  BMCBI 2010»
14 years 11 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
102
Voted
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
15 years 1 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...