228 search results - page 31 / 46 » Relational queries over interpreted structures |
114
click to vote
JAPLL
2006
15 years 4 months ago
2006
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures...
132
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present a strategy for generating real-time relative depth maps of an environment from optical flow, under general motion. We achieve this using an insect-inspired hemisphe...
101
click to vote
PVLDB
2010
15 years 2 months ago
2010
We demonstrate an efficient LINQ to SQL provider and its significant impact on the runtime performance of LINQ programs that process large data volumes. This alternative provider...
159
click to vote
LOGCOM
2002
15 years 3 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
132
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...