Sciweavers

1000 search results - page 141 / 200
» Dependency Tree Automata
Sort
View
90
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 2 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
BMCBI
2010
104views more  BMCBI 2010»
15 years 2 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...
CORR
2000
Springer
110views Education» more  CORR 2000»
15 years 2 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
108
Voted
NAACL
2010
15 years 13 days 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
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
14 years 2 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro