Sciweavers

170 search results - page 14 / 34
» Parsing with Non-Deterministic Functions
Sort
View
DCC
2004
IEEE
14 years 7 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
LREC
2010
175views Education» more  LREC 2010»
13 years 9 months ago
The Creation of a Large-Scale LFG-Based Gold Parsebank
Systems for syntactically parsing sentences have long been recognized as a priority in Natural Language Processing. Statistics-based systems require large amounts of high quality ...
Alexis Baird, Christopher R. Walker
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Incremental Sigmoid Belief Networks for Grammar Learning
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
James Henderson, Ivan Titov
ISCAS
2007
IEEE
101views Hardware» more  ISCAS 2007»
14 years 1 months ago
Flexible and Cost Effective Transport Stream Processor for DTV
— A flexible transport stream processor for DTV which is also designed under cost-effective consideration is proposed in this paper. A RISC micro-controller is allocated as the ...
Chia-Liang Tsai, Shao-Yi Chien
APSEC
2004
IEEE
13 years 11 months ago
Accurate Call Graph Extraction of Programs with Function Pointers Using Type Signatures
Software engineers need to understand programs in order to effectively maintain them. The call graph, which presents the calling relationships between functions, is a useful repre...
Darren C. Atkinson