Sciweavers

1228 search results - page 19 / 246
» Continuations, proofs and tests
Sort
View
FORMATS
2008
Springer
13 years 9 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
ICIP
2001
IEEE
14 years 9 months ago
A comparison of discrete and continuous output modeling techniques for a pseudo-2D hidden Markov model face recognition system
Face recognition has become an important topic within the field of pattern recognition and computer vision. In this field a number of different approaches to feature extraction, m...
Frank Wallhoff, Stefan Eickeler, Gerhard Rigoll
SMA
2008
ACM
203views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Interactive continuous collision detection between deformable models using connectivity-based culling
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
Min Tang, Sean Curtis, Sung-Eui Yoon, Dinesh Manoc...
UAI
2008
13 years 9 months ago
CT-NOR: Representing and Reasoning About Events in Continuous Time
We present a generative model for representing and reasoning about the relationships among events in continuous time. We apply the model to the domain of networked and distributed...
Aleksandr Simma, Moisés Goldszmidt, John Ma...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 2 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret