Sciweavers

1174 search results - page 22 / 235
» Functional Trees
Sort
View
96
Voted
ACL
2000
15 years 1 months ago
An Improved Parser for Data-Oriented Lexical-Functional Analysis
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...
Rens Bod
BMCBI
2010
155views more  BMCBI 2010»
14 years 9 months ago
BrEPS: a flexible and automatic protocol to compute enzyme-specific sequence profiles for functional annotation
Background: Models for the simulation of metabolic networks require the accurate prediction of enzyme function. Based on a genomic sequence, enzymatic functions of gene products a...
Constantin Bannert, A. Welfle, C. aus dem Spring, ...
IPL
2006
103views more  IPL 2006»
14 years 11 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
IPL
2006
87views more  IPL 2006»
14 years 11 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski
CP
2010
Springer
14 years 9 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex