Sciweavers

898 search results - page 76 / 180
» An Analysis of Permutations in Arrays
Sort
View
ASIACRYPT
2000
Springer
15 years 10 months ago
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
Anand Desai, Sara K. Miner
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
ESANN
2004
15 years 7 months ago
Separability of analytic postnonlinear blind source separation with bounded sources
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...
Fabian J. Theis, Peter Gruber
WSC
2004
15 years 7 months ago
Quasi-Monte Carlo Methods in Finance
We review the basic principles of Quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variancereduction techniques, and the main classes of constructions under...
Pierre L'Ecuyer
ICA
2010
Springer
15 years 6 months ago
Adaptive Segmentation and Separation of Determined Convolutive Mixtures under Dynamic Conditions
Abstract. In this paper, we propose a method for blind source separation (BSS) of convolutive audio recordings with short blocks of stationary sources, i.e. dynamically changing so...
Benedikt Loesch, Bin Yang