846 search results - page 62 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
87
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
103
Voted
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Recognition of complex activities from surveillance video requires detection and temporal ordering of its constituent "atomic" events. It also requires the capacity to ro...
160
Voted
AAAI
2011
14 years 21 days ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
114
Voted
IJAR
2010
14 years 11 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...