1923 search results - page 180 / 385 » Weighted Decision Trees |
164
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
168
click to vote
FSTTCS
2007
Springer
16 years 18 days ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
178
click to vote
CIAC
2000
Springer
15 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
167
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
170
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...