Sciweavers

2214 search results - page 182 / 443
» Complexity of Reasoning
Sort
View
146
Voted
ROMAN
2007
IEEE
179views Robotics» more  ROMAN 2007»
15 years 10 months ago
A Bayesian Network Framework for Vision Based Semantic Scene Understanding
— For a robot to understand a scene, we have to infer and extract meaningful information from vision sensor data. Since scene understanding consists in recognizing several visual...
Seung-Bin Im, Keum-Sung Hwang, Sung-Bae Clio
114
Voted
CSL
2000
Springer
15 years 8 months ago
Composition and Submachine Concepts for Sequential ASMs
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
Egon Börger, Joachim Schmid
118
Voted
GIS
1999
ACM
15 years 8 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
132
Voted
CSL
2008
Springer
15 years 5 months ago
An Infinite Automaton Characterization of Double Exponential Time
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
130
Voted
CSL
2007
Springer
15 years 9 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart