Sciweavers

4911 search results - page 275 / 983
» Tree dependence analysis
Sort
View
117
Voted
FSTTCS
2008
Springer
15 years 5 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
104
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 4 months ago
Approximation Algorithms for Treewidth
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
Eyal Amir
135
Voted
BMCBI
2010
104views more  BMCBI 2010»
15 years 4 months ago
Using simple artificial intelligence methods for predicting amyloidogenesis in antibodies
Background: All polypeptide backbones have the potential to form amyloid fibrils, which are associated with a number of degenerative disorders. However, the likelihood that amyloi...
Maria Pamela C. David, Gisela P. Concepcion, Eduar...
138
Voted
CORR
2000
Springer
110views Education» more  CORR 2000»
15 years 4 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
NAACL
2010
15 years 2 months ago
An extractive supervised two-stage method for sentence compression
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
Dimitrios Galanis, Ion Androutsopoulos