Sciweavers

6251 search results - page 360 / 1251
» Randomness, Computability, and Density
Sort
View
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 5 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
MICCAI
2007
Springer
16 years 7 months ago
Robust Computation of Mutual Information Using Spatially Adaptive Meshes
Abstract. We present a new method for the fast and robust computation of information theoretic similarity measures for alignment of multi-modality medical images. The proposed meth...
Hari Sundar, Dinggang Shen, George Biros, Chenyang...
SBRN
2008
IEEE
16 years 1 months ago
Imitation Learning of an Intelligent Navigation System for Mobile Robots Using Reservoir Computing
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
209
Voted
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
16 years 28 days ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li