Sciweavers

1510 search results - page 74 / 302
» Upper Probabilities and Additivity
Sort
View
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
15 years 3 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
FOCS
2006
IEEE
15 years 3 months ago
New Limits on Fault-Tolerant Quantum Computation
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
Harry Buhrman, Richard Cleve, Monique Laurent, Noa...
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 10 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
Satish Babu Korada, Nicolas Macris
ICDE
2007
IEEE
109views Database» more  ICDE 2007»
15 years 11 months ago
Evaluating Proximity Relations Under Uncertainty
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
Zhengdao Xu, Hans-Arno Jacobsen
ISW
2009
Springer
15 years 4 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner