Sciweavers

2834 search results - page 131 / 567
» Representing Trees with Constraints
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 9 months ago
Near-Entropy Hotlink Assignments
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
Karim Douïeb, Stefan Langerman
BMCBI
2007
116views more  BMCBI 2007»
15 years 5 months ago
primetv: a viewer for reconciled trees
Background: Evolutionary processes, such as gene family evolution or parasite-host cospeciation, can often be viewed as a tree evolving inside another tree. Relating two given tre...
Bengt Sennblad, Eva Schreil, Ann-Charlotte Berglun...
IANDC
2011
129views more  IANDC 2011»
15 years 14 days ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
INFOCOM
2007
IEEE
15 years 11 months ago
A Cost-Based Evaluation of End-to-End Network Measurements in Overlay Multicast
Abstract— Application-layer multicast (ALM, or overlay multicast) has been proposed to overcome limitations in IP multicast. While much measurement work (such as delay or connect...
Xing Jin, Qiuyan Xia, S.-H. Gary Chan
PKDD
2005
Springer
95views Data Mining» more  PKDD 2005»
15 years 11 months ago
Ensembles of Balanced Nested Dichotomies for Multi-class Problems
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...
Lin Dong, Eibe Frank, Stefan Kramer