Sciweavers

141 search results - page 25 / 29
» Destruction of Very Simple Trees
Sort
View
RECOMB
2002
Springer
15 years 9 months ago
Probabilistic hierarchical clustering for biological data
Biological data, such as gene expression profiles or protein sequences, is often organized in a hierarchy of classes, where the instances assigned to "nearby" classes in...
Eran Segal, Daphne Koller
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
ACL
1998
14 years 11 months ago
Compacting the Penn Treebank Grammar
Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...
Alexander Krotov, Mark Hepple, Robert J. Gaizauska...
71
Voted
TCS
1998
14 years 9 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
COCOON
2006
Springer
15 years 1 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia