16430 search results - page 565 / 3286 » On Computable Tree Functions |
172
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
223
click to vote
BIOCOMP
2006
15 years 8 months ago
2006
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
169
click to vote
EACL
2003
ACL Anthology
15 years 8 months ago
2003
ACL Anthology
Two apparently opposing DOP models exist in the literature: one which computes the parse tree involving the most frequent subtrees from a treebank and one which computes the parse...
243
click to vote
JFPLC
2004
15 years 8 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
181
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...