Sciweavers

440 search results - page 14 / 88
» Comparison of Galled Trees
Sort
View
LATA
2009
Springer
14 years 3 months ago
Rigid Tree Automata
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 rest...
Florent Jacquemard, Francis Klay, Camille Vacher
MCS
2004
Springer
14 years 2 months ago
A Comparison of Ensemble Creation Techniques
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
ICNP
1996
IEEE
14 years 28 days ago
A Comparison of Known Classes of Reliable Multicast Protocols
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...
Brian Neil Levine, J. J. Garcia-Luna-Aceves
MMS
1998
13 years 8 months ago
A Comparison of Reliable Multicast Protocols
We analyze the maximum throughput that known classes of reliable multicast transport protocols can attain. A new taxonomy of reliable multicast transport protocols is introduced ba...
Brian Neil Levine, J. J. Garcia-Luna-Aceves
NORDICHI
2004
ACM
14 years 2 months ago
Software usability: a comparison between two tree-structured data transformation languages
This paper presents the results of a software usability study, involving both subjective and objective evaluation. It compares a popular XML data transformation language (XSLT) an...
Nikita Schmidt, Corina Sas