Sciweavers

222 search results - page 11 / 45
» Gesture Modeling and Recognition Using Finite State Machines
Sort
View
92
Voted
KBSE
2002
IEEE
15 years 4 months ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic
COLT
1995
Springer
15 years 3 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
AAAI
2008
15 years 2 months ago
Optimal Metric Planning with State Sets in Automata Representation
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Björn Ulrich Borowsky, Stefan Edelkamp
ITC
1998
IEEE
126views Hardware» more  ITC 1998»
15 years 3 months ago
A comprehensive approach to the partial scan problem using implicit state enumeration
This paper presents a novel technique to evaluate the noncontrollability measures of state registers for partial scan design. Our model uses implicit techniques for finite state ma...
Priyank Kalla, Maciej J. Ciesielski
90
Voted
ICIAP
2001
Springer
15 years 12 months ago
Recognition of Shape-Changing Hand Gestures Based on Switching Linear Model
We present a method to track and recognize shape-changing hand gestures simultaneously. The switching linear model using active contour model well corresponds to temporal shapes a...
Mun Ho Jeong, Yoshinori Kuno, Nobutaka Shimada, Yo...