Sciweavers

284 search results - page 34 / 57
» Efficient Parsing for French
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 3 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
JMLR
2010
143views more  JMLR 2010»
14 years 6 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
DCC
2004
IEEE
15 years 11 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...
ECCV
2002
Springer
16 years 1 months ago
Learning to Parse Pictures of People
The detection of people is one of the foremost problems for indexing, browsing and retrieval of video. The main difficulty is the large appearance variations caused by action, clot...
Rémi Ronfard, Cordelia Schmid, Bill Triggs
ICPR
2004
IEEE
16 years 26 days ago
Condensation Tracking through a Hough Space
Recent work has shown tracking groups of lines through the parameter space represented by a Hough accumulator array to be efficient and insensitive to both occlusion and changes i...
Andrew French, Steven Mills, Tony P. Pridmore