Sciweavers

1541 search results - page 108 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
157
Voted
IMC
2010
ACM
15 years 2 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
ICASSP
2011
IEEE
14 years 8 months ago
Langevin and hessian with fisher approximation stochastic sampling for parameter estimation of structured covariance
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
Cornelia Vacar, Jean-François Giovannelli, ...
IJNSEC
2006
131views more  IJNSEC 2006»
15 years 4 months ago
A Frobenius Map Approach for an Efficient and Secure Multiplication on Koblitz
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier ...
Mustapha Hedabou
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
15 years 10 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 5 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori