Sciweavers

1000 search results - page 198 / 200
» Dependency Tree Automata
Sort
View
BMCBI
2005
100views more  BMCBI 2005»
14 years 9 months ago
Scoredist: A simple and robust protein sequence distance estimator
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
Erik L. L. Sonnhammer, Volker Hollich
JSAC
2007
128views more  JSAC 2007»
14 years 9 months ago
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
— Most of the real deployed peer-to-peer streaming systems adopt pull-based streaming protocol. In this paper, we demonstrate that, besides simplicity and robustness, with proper...
Meng Zhang, Qian Zhang, Lifeng Sun, Shiqiang Yang
COLING
2002
14 years 9 months ago
The LinGO Redwoods Treebank: Motivation and Preliminary Applications
The LinGO Redwoods initiative is a seed activity in the design and development of a new type of treebank. While several medium- to large-scale treebanks exist for English (and for...
Stephan Oepen, Kristina Toutanova, Stuart M. Shieb...
83
Voted
COLING
2002
14 years 9 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
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...