411 search results - page 32 / 83 » A New Approach to the Rectilinear Steiner Tree Problem |
ECCV
1998
Springer
15 years 11 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
WOB
2004
14 years 11 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
ACL
2004
14 years 11 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...