Sciweavers

4007 search results - page 126 / 802
» Computation with imprecise probabilities
Sort
View
120
Voted
FOCS
2009
IEEE
15 years 7 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
136
Voted
BNCOD
2008
143views Database» more  BNCOD 2008»
15 years 5 months ago
Reconciling Inconsistent Data in Probabilistic XML Data Integration
Abstract. The problem of dealing with inconsistent data while integrating XML data from different sources is an important task, necessary to improve data integration quality. Typic...
Tadeusz Pankowski
127
Voted
PPL
2000
110views more  PPL 2000»
15 years 3 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
123
Voted
PODC
2005
ACM
15 years 9 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
VLSID
2009
IEEE
87views VLSI» more  VLSID 2009»
16 years 4 months ago
Soft Error Rates with Inertial and Logical Masking
We analyze the neutron induced soft error rate (SER). An induced error pulse is modeled by two parameters, probability of occurrence and probability density function of the pulse ...
Fan Wang, Vishwani D. Agrawal