Sciweavers

241 search results - page 38 / 49
» Learning Classes of Probabilistic Automata
Sort
View
TIP
2008
157views more  TIP 2008»
13 years 7 months ago
Robust Face Tracking via Collaboration of Generic and Specific Models
Significant appearance changes of objects under different orientations could cause loss of tracking, "drifting." In this paper, we present a collaborative tracking framew...
Peng Wang, Qiang Ji
WWW
2008
ACM
14 years 8 months ago
Learning deterministic regular expressions for the inference of schemas from XML data
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn V...
CVPR
2010
IEEE
14 years 3 months ago
Dynamical Binary Latent Variable Models for 3D Human Pose Tracking
We introduce a new class of probabilistic latent variable model called the Implicit Mixture of Conditional Restricted Boltzmann Machines (imCRBM) for use in human pose tracking. K...
Graham Taylor, Leonid Sigal, David Fleet, Geoffrey...
FASE
2008
Springer
13 years 9 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 8 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens