Sciweavers

311 search results - page 1 / 63
» Study of the Probabilistic Information of a Random Set
Sort
View
ISIPTA
2003
IEEE
13 years 10 months ago
Study of the Probabilistic Information of a Random Set
Given a random set coming from the imprecise observation of a random variable, we study how to model the information about the distribution of this random variable. Specifically,...
Enrique Miranda, Inés Couso, Pedro Gil
DC
2000
13 years 4 months ago
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
Anna Pogosyants, Roberto Segala, Nancy A. Lynch
EUROCRYPT
2012
Springer
11 years 7 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
AUSAI
2005
Springer
13 years 10 months ago
Neighborhood Re-structuring in Particle Swarm Optimization
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...
GLOBECOM
2007
IEEE
13 years 11 months ago
On the (in)Effectiveness of Probabilistic Marking for IP Traceback Under DDoS Attacks
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
Vamsi Paruchuri, Arjan Durresi, Raj Jain