Sciweavers

316 search results - page 10 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
IJCAI
2003
14 years 11 months ago
A General Model for Online Probabilistic Plan Recognition
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
Hung Hai Bui
MOC
1998
106views more  MOC 1998»
14 years 9 months ago
Computations of class numbers of real quadratic fields
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
Anitha Srinivasan
ICRA
2003
IEEE
167views Robotics» more  ICRA 2003»
15 years 2 months ago
Local exploration: online algorithms and a probabilistic framework
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
Volkan Isler, Sampath Kannan, Kostas Daniilidis
ICASSP
2011
IEEE
14 years 1 months ago
Efficient implementation of probabilistic multi-pitch tracking
We significantly improve the computational efficiency of a probabilistic approach for multiple pitch tracking. This method is based on a factorial hidden Markov model and two al...
Michael Wohlmayr, Robert Peharz, Franz Pernkopf
ICMLA
2008
14 years 11 months ago
Probabilistic Exploitation of the Lucas and Kanade Smoothness Constraint
The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constrai...
Volker Willert, Julian Eggert, Marc Toussaint, Edg...