Sciweavers

4095 search results - page 98 / 819
» How to test a tree
Sort
View
IPPS
2000
IEEE
14 years 2 months ago
Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-inse...
Petr Salinger, Pavel Tvrdík
MFCS
2005
Springer
14 years 3 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
13 years 10 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 10 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
CPAIOR
2007
Springer
14 years 4 months ago
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal