Sciweavers

4007 search results - page 225 / 802
» Computation with imprecise probabilities
Sort
View
LICS
2000
IEEE
15 years 8 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
RSS
2007
136views Robotics» more  RSS 2007»
15 years 5 months ago
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
Ron Alterovitz, Thierry Siméon, Kenneth Y. ...
BMCBI
2010
117views more  BMCBI 2010»
15 years 4 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
PAMI
2010
103views more  PAMI 2010»
15 years 2 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
ICIP
2003
IEEE
16 years 5 months ago
Dither-modulation data hiding with distortion-compensation: exact performance analysis and an improved detector for JPEG attacks
The binary Distortion Compensated Dither-Modulation (DCDM), which can be regarded to as a baseline for quantizationbased data-hiding methods, is rigorously analyzed. A novel and a...
Félix Balado, Fernando Pérez-Gonz&aa...