Sciweavers

9209 search results - page 2 / 1842
» Data Space Randomization
Sort
View
GBRPR
2009
Springer
13 years 9 months ago
From Random to Hierarchical Data through an Irregular Pyramidal Structure
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
Rimon Elias, Mohab Al Ashraf, Omar Aly
ACSAC
2006
IEEE
13 years 11 months ago
Address Space Layout Permutation (ASLP): Towards Fine-Grained Randomization of Commodity Software
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process in...
Chongkyung Kil, Jinsuk Jun, Christopher Bookholt, ...
ACSAC
2006
IEEE
13 years 11 months ago
Address-Space Randomization for Windows Systems
Address-space randomization (ASR) is a promising solution to defend against memory corruption attacks that have contributed to about three-quarters of USCERT advisories in the pas...
Lixin Li, James E. Just, R. Sekar
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
13 years 10 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
ICALP
2009
Springer
14 years 5 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang