Sciweavers

744 search results - page 123 / 149
» Observations on the Decidability of Transitions
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
COLT
2008
Springer
13 years 10 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
AIPS
2006
13 years 10 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
GRAPHICSINTERFACE
2004
13 years 10 months ago
Segmenting Motion Capture Data into Distinct Behaviors
Much of the motion capture data used in animations, commercials, and video games is carefully segmented into distinct motions either at the time of capture or by hand after the ca...
Jernej Barbic, Alla Safonova, Jia-Yu Pan, Christos...
GRAPHICSINTERFACE
2001
13 years 10 months ago
Truly Selective Refinement of Progressive Meshes
This paper presents a novel selective refinement scheme of progressive meshes. In previous schemes, topology information in the neighborhood of a collapsed edge is stored in the a...
Junho Kim, Seungyong Lee