Sciweavers

3233 search results - page 382 / 647
» Probabilistic Data Exchange
Sort
View
EMMCVPR
2001
Springer
14 years 25 days ago
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
Manuele Bicego, Agostino Dovier, Vittorio Murino
ICVS
1999
Springer
14 years 18 days ago
Action Reaction Learning: Automatic Visual Analysis and Synthesis of Interactive Behaviour
We propose Action-Reaction Learning as an approach for analyzing and synthesizing human behaviour. This paradigm uncovers causal mappings between past and future events or between...
Tony Jebara, Alex Pentland
WG
1993
Springer
14 years 12 days ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
ICB
2007
Springer
161views Biometrics» more  ICB 2007»
14 years 6 days ago
Latent Identity Variables: Biometric Matching Without Explicit Identity Estimation
Abstract. We present a new approach to biometrics that makes probabilistic inferences about matching without ever estimating an identity "template". The biometric data is...
Simon J. D. Prince, Jania Aghajanian, Umar Mohamme...
AAAI
2010
13 years 9 months ago
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
Andrey Kolobov, Mausam, Daniel S. Weld