Sciweavers

3247 search results - page 147 / 650
» Randomized smoothing networks
Sort
View
CDC
2010
IEEE
148views Control Systems» more  CDC 2010»
14 years 11 months ago
Convergence rates of consensus algorithms in stochastic networks
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
Stacy Patterson, Bassam Bamieh
ASIACRYPT
2004
Springer
15 years 9 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
AIED
2009
Springer
15 years 10 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
131
Voted
SRDS
2007
IEEE
15 years 10 months ago
RandSys: Thwarting Code Injection Attacks with System Service Interface Randomization
Code injection attacks are a top threat to today’s Internet. With zero-day attacks on the rise, randomization techniques have been introduced to diversify software and operation...
Xuxian Jiang, Helen J. Wang, Dongyan Xu, Yi-Min Wa...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 6 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin