Sciweavers

1269 search results - page 6 / 254
» Learning Correction Grammars
Sort
View
DLT
2006
13 years 8 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
CVPR
2010
IEEE
14 years 3 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
ALT
2005
Springer
14 years 4 months ago
Non U-Shaped Vacillatory and Team Learning
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science...
Lorenzo Carlucci, John Case, Sanjay Jain, Frank St...
ICTAI
2007
IEEE
14 years 1 months ago
Constructing VEGGIE: Machine Learning for Context-Sensitive Graph Grammars
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
Keven Ates, Kang Zhang
NAACL
2010
13 years 5 months ago
Products of Random Latent Variable Grammars
We show that the automatically induced latent variable grammars of Petrov et al. (2006) vary widely in their underlying representations, depending on their EM initialization point...
Slav Petrov