Sciweavers

686 search results - page 35 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
127
Voted
ESANN
2007
15 years 5 months ago
A novel kernel-based method for local pattern extraction in random process signals
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...
Majid Beigi, Andreas Zell
161
Voted
ICC
2011
IEEE
219views Communications» more  ICC 2011»
14 years 3 months ago
Deterministic Equivalents for the Performance Analysis of Isometric Random Precoded Systems
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
Jakob Hoydis, Romain Couillet, Mérouane Deb...
144
Voted
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
15 years 5 months ago
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
Alexandra Boldyreva, Serge Fehr, Adam O'Neill
PODC
2009
ACM
16 years 4 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
ICPR
2004
IEEE
16 years 4 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna