Sciweavers

564 search results - page 59 / 113
» Training Tree Transducers
Sort
View
EMNLP
2009
13 years 6 months ago
Parser Adaptation and Projection with Quasi-Synchronous Grammar Features
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
David A. Smith, Jason Eisner
CVPR
2010
IEEE
14 years 5 months ago
A Hough Transform-Based Voting Framework for Action Recognition
We present a method to classify and localize human actions in video using a Hough transform voting framework. Random trees are trained to learn a mapping between densely-sampled f...
Angela Yao, Juergen Gall, Luc Van Gool
LATA
2010
Springer
14 years 3 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
ICPR
2008
IEEE
14 years 3 months ago
A symbol graph based handwritten math expression recognition
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...
Yu Shi, Frank K. Soong
IDA
2007
Springer
14 years 3 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski