Sciweavers

4007 search results - page 138 / 802
» Computation with imprecise probabilities
Sort
View
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 6 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
ESOP
2005
Springer
15 years 11 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
EUROCRYPT
2005
Springer
15 years 11 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
SC
2003
ACM
15 years 11 months ago
Synthesizing Realistic Computational Grids
Realistic workloads are essential in evaluating middleware for computational grids. One important component is the raw grid itself: a network topology graph annotated with the har...
Dong Lu, Peter A. Dinda
BIRTHDAY
2003
Springer
15 years 11 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem