Sciweavers

1511 search results - page 78 / 303
» On the effectiveness of address-space randomization
Sort
View
COMBINATORICA
2000
157views more  COMBINATORICA 2000»
13 years 7 months ago
Concentration of Multivariate Polynomials and Its Applications
Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in ti's with positive coefficients. We give a conditi...
Jeong Han Kim, Van H. Vu
LCN
2007
IEEE
14 years 2 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...
CGO
2010
IEEE
14 years 6 days ago
Umbra: efficient and scalable memory shadowing
Shadow value tools use metadata to track properties of application data at the granularity of individual machine instructions. These tools provide effective means of monitoring an...
Qin Zhao, Derek Bruening, Saman P. Amarasinghe
ASPLOS
2008
ACM
13 years 10 months ago
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
Michal Wegiel, Chandra Krintz

Book
361views
15 years 5 months ago
Introduction to Statistical Signal Processing
"A random or stochastic process is a mathematical model for a phenomenon that evolves in time in an unpredictable manner from the viewpoint of the observer. The phenomenon m...
R.M. Gray