Sciweavers

1916 search results - page 163 / 384
» Reconfiguring a state machine
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Recognition and reproduction of gestures using a probabilistic framework combining PCA, ICA and HMM
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
Sylvain Calinon, Aude Billard
ICML
2005
IEEE
14 years 9 months ago
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers
We extend the PAC-Bayes theorem to the sample-compression setting where each classifier is represented by two independent sources of information: a compression set which consists ...
François Laviolette, Mario Marchand
ICML
2001
IEEE
14 years 9 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
John D. Lafferty, Andrew McCallum, Fernando C. N. ...
ISCIS
2009
Springer
14 years 2 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
ICML
2006
IEEE
14 years 2 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup