1999 search results - page 62 / 400 » Dependently Typed Grammars |
154
click to vote
RIDE
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a scheme for identifying instances of events and extracting information about them. The scheme can handle all events with which an action can be associat...
175
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
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...
153
click to vote
TSD
2005
Springer
15 years 11 months ago
2005
Springer
In this paper a new rule-based approach to break assignment for the Russian language is discussed. It is a flexible and robust method of segmentation of texts in Russian in prosod...
173
click to vote
EMNLP
2004
15 years 7 months ago
2004
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...
204
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...