Sciweavers

3333 search results - page 104 / 667
» Abstract Proof Search
Sort
View
158
Voted
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
15 years 10 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
108
Voted
CSL
2007
Springer
15 years 9 months ago
Propositional Logic for Circuit Classes
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
Klaus Aehlig, Arnold Beckmann
HUMO
2007
Springer
15 years 9 months ago
3D Hand Tracking in a Stochastic Approximation Setting
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...
Desmond Chik, Jochen Trumpf, Nicol N. Schraudolph
141
Voted
LPAR
2004
Springer
15 years 9 months ago
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
Mark Bickford, Robert L. Constable, Joseph Y. Halp...
148
Voted
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Alon Rosen