Sciweavers

686 search results - page 107 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
MST
2006
136views more  MST 2006»
13 years 8 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
TIT
2002
95views more  TIT 2002»
13 years 8 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
WISEC
2010
ACM
14 years 1 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 3 months ago
Reconciling Compressive Sampling Systems for Spectrally-sparse Continuous-time Signals
The Random Demodulator (RD) and the Modulated Wideband Converter (MWC) are two recently proposed compressed sensing (CS) techniques for the acquisition of continuous-time spectral...
Michael A. Lexa, Mike E. Davies, John S. Thompson