Sciweavers

Share
DAM
2007
70views more  DAM 2007»
8 years 8 months ago
Tree-edges deletion problems with bounded diameter obstruction sets
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
Dekel Tsur
JBI
2006
8 years 8 months ago
Support versus corroboration
Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are desc...
Mary G. Egan
JIIS
2008
95views more  JIIS 2008»
8 years 8 months ago
Approximate schemas, source-consistency and query answering
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
Michel de Rougemont, Adrien Vieilleribière
CORR
2007
Springer
60views Education» more  CORR 2007»
8 years 8 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
CORR
2007
Springer
106views Education» more  CORR 2007»
8 years 8 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
CORR
2007
Springer
100views Education» more  CORR 2007»
8 years 8 months ago
The Haar Wavelet Transform of a Dendrogram: Additional Notes
We consider the wavelet transform of a finite, rooted, node-ranked, p-way tree, focusing on the case of binary (p = 2) trees. We study a Haar wavelet transform on this tree. Wave...
Fionn Murtagh
JAIR
2008
94views more  JAIR 2008»
8 years 8 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser
IS
2008
8 years 8 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
CN
2007
97views more  CN 2007»
8 years 8 months ago
A longest prefix first search tree for IP lookup
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen
COMCOM
2006
81views more  COMCOM 2006»
8 years 8 months ago
A case for tree evolution in QoS multicasting
The phenomenal growth of group communications and QoS-aware applications over the Internet have accelerated the development of multicasting technologies. The Core-Based Tree (CBT) ...
Anirban Chakrabarti, G. Manimaran
books