662 search results - page 41 / 133 » Computing the Temporal Structure of Events in Natural Langua... |
115
Voted
CIE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
96
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
NIPS
1998
15 years 1 months ago
1998
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
98
Voted
ACL
2007
15 years 2 months ago
2007
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
124
click to vote
BMVC
1996
15 years 1 months ago
1996
This paper describes the continuing development of a system for tracking multiple man made objects, (typically vehicles) moving in a natural open world scene, where the detected m...