870 search results - page 25 / 174 » Theoretical and experimental results on the goal-plan tree p... |
BMCBI
2006
13 years 9 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
SETA
2004
Springer
14 years 3 months ago
2004
Springer
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
AAAI
2004
13 years 11 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
VLDB
2006
ACM
14 years 10 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...