Sciweavers

6306 search results - page 195 / 1262
» Space, Time, and the Use of Language
Sort
View
COLT
1992
Springer
15 years 2 months ago
Polynomial Time Inference of a Subclass of Context-Free Transformations
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
VLSID
1999
IEEE
101views VLSI» more  VLSID 1999»
15 years 2 months ago
Formal System Design Based on the Synchrony Hypothesis, Functional Models and Skeletons
Formal approaches to HW and system design have not been generally adopted, because designers often view the modelling concepts in these approaches as unsuitable for their problems...
Ingo Sander, Axel Jantsch
IJCV
2008
191views more  IJCV 2008»
14 years 10 months ago
Searching for Complex Human Activities with No Visual Examples
Abstract We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our ...
Nazli Ikizler, David A. Forsyth
ACL
1989
14 years 12 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
TIME
2009
IEEE
15 years 5 months ago
Event-Oriented Data Models and Temporal Queries in Transaction-Time Databases
—Past research on temporal databases has primarily focused on state-based representations and on relational query language extensions for such representations. This led to many d...
Carlo Zaniolo