Sciweavers

Share
TDSC
2010
119views more  TDSC 2010»
7 years 11 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...
ACSAC
2010
IEEE
8 years 2 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
WDAG
2010
Springer
168views Algorithms» more  WDAG 2010»
8 years 2 months ago
Fast Randomized Test-and-Set and Renaming
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei G...
ECCC
2007
62views more  ECCC 2007»
8 years 4 months ago
Space Hierarchy Results for Randomized and Other Semantic Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...
Jeff Kinne, Dieter van Melkebeek
EC
2007
167views ECommerce» more  EC 2007»
8 years 4 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
IPL
2006
61views more  IPL 2006»
8 years 4 months ago
Fair service for mice in the presence of elephants
We show how randomized caches can be used in resource-poor partial-state routers to provide a fair share of bandwidth to short-lived flows that are known as mice when long-lived f...
Seth Voorhies, Hyunyoung Lee, Andreas Klappenecker
JC
2008
87views more  JC 2008»
8 years 4 months ago
The randomized complexity of initial value problems
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
Stefan Heinrich, Bernhard Milla
DAM
2006
79views more  DAM 2006»
8 years 4 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
CORR
2010
Springer
320views Education» more  CORR 2010»
8 years 4 months ago
An algorithm for the principal component analysis of large data sets
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...
Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnis...
CORR
2010
Springer
171views Education» more  CORR 2010»
8 years 4 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
books