Sciweavers

124 search results - page 7 / 25
» Randomly supported independence and resistance
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
RSA
1998
93views more  RSA 1998»
13 years 7 months ago
Parallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
14 years 1 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 11 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
MICCAI
2008
Springer
14 years 8 months ago
Segmenting Brain Tumors Using Pseudo-Conditional Random Fields
Locating Brain tumor segmentation within MR (magnetic resonance) images is integral to the treatment of brain cancer. This segmentation task requires classifying each voxel as eith...
Chi-Hoon Lee, Shaojun Wang, Albert Murtha, Matt...