535 search results - page 39 / 107 » Generalized Version Space Trees |
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
138
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
118
click to vote
DAC
1994
ACM
15 years 3 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
CGF
2008
14 years 12 months ago
2008
We present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeli...
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...