Sciweavers

648 search results - page 10 / 130
» Lowness for Demuth Randomness
Sort
View
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
15 years 10 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
ACSAC
2010
IEEE
14 years 7 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
CN
2010
121views more  CN 2010»
14 years 6 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
RSA
2000
170views more  RSA 2000»
14 years 9 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
IAJIT
2010
193views more  IAJIT 2010»
14 years 8 months ago
Performance of OCDMA Systems Using Random Diagonal Code for Different Decoders Architecture Schemes
: In this paper, new code families are constructed for spectral-amplitude coding optical code division multiple access, called random diagonal code for spectral amplitude coding op...
Hilal Adnan Fadhil, Syed Alwee Aljunid, Badlished ...