Sciweavers

3677 search results - page 688 / 736
» Is a probabilistic modeling
Sort
View
EUROCRYPT
2003
Springer
14 years 3 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
13 years 8 months ago
Rao-Blackwellized particle filtering for probing-based 6-DOF localization in robotic assembly
This paper presents a probing-based method for probabilistic localization in automated robotic assembly. We consider peg-in-hole problems in which a needle-like peg has a single p...
Yuichi Taguchi, Tim K. Marks, Haruhisa Okuda
ICGI
2010
Springer
13 years 8 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
BMCBI
2002
108views more  BMCBI 2002»
13 years 10 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
13 years 1 months ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...