20 search results - page 3 / 4 » Extending Stochastic Context-Free Grammars for an Applicatio... |
COLING
1996
13 years 7 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
ACCV
2006
Springer
13 years 9 months ago
2006
Springer
Stochastic grammar has been used in many video analysis and event recognition applications as an efficient model to represent large-scale video activity. However, in previous works...
ICVGIP
2004
13 years 7 months ago
2004
A segmentation algorithm, which can detect different regions of a handwritten document such as text lines, tables and sketches will be extremely useful in a variety of application...
CSB
2004
IEEE
13 years 9 months ago
2004
IEEE
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
BMCBI
2011
13 years 4 days ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...