680 search results - page 9 / 136 » A randomized embedding algorithm for trees |
RECOMB
2008
Springer
16 years 1 months ago
2008
Springer
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
108
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
124
click to vote
WSCG
2004
15 years 2 months ago
2004
This paper proposes an embedded rate scalable wavelet-based image coding algorithm. We introduce a simple and efficient approach for coding the positions and the signs of the wave...
109
click to vote
ICAISC
2010
Springer
15 years 6 months ago
2010
Springer
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...