Sciweavers

3954 search results - page 403 / 791
» Image-based Model Completion
Sort
View
136
Voted
ENTCS
2007
143views more  ENTCS 2007»
15 years 4 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
168
Voted
IEICET
2007
110views more  IEICET 2007»
15 years 4 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
IJCV
2007
157views more  IJCV 2007»
15 years 4 months ago
Recovering Surface Layout from an Image
Humans have an amazing ability to instantly grasp the overall 3D structure of a scene – ground orientation, relative positions of major landmarks, etc – even from a single ima...
Derek Hoiem, Alexei A. Efros, Martial Hebert
134
Voted
TPLP
2008
89views more  TPLP 2008»
15 years 4 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
AI
2004
Springer
15 years 4 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne