نتایج جستجو برای: extractors

تعداد نتایج: 1871  

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2005
Marius Zimand

Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-co...

Journal: :J. Comput. Syst. Sci. 1999
Noam Nisan Amnon Ta-Shma

Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related ``dispersers,'' exhibit some of the most ``random-like'' properties of explicitly constructed combinatorial structures. In this paper we do two things. First, we survey extractors and ...

Journal: :Designs, Codes and Cryptography 2008

Journal: :CoRR 2016
Kai-Min Chung Gil Cohen Thomas Vidick Xiaodi Wu

We give the first construction of a family of quantum-proof extractors that has optimal seed length dependence O(log(n/ǫ)) on the input length n and error ǫ. Our extractors support any min-entropy k = Ω(log n+ log(1/ǫ)) and extract m = (1− α)k bits that are ǫ-close to uniform, for any desired constant α > 0. Previous constructions had a quadratically worse seed length or were restricted to very...

2002
Salil P. Vadhan

Since its introduction by Nisan and Zuckerman (STOC ‘93) nearly a decade ago, the notion of a randomness extractor has proven to be a fundamental and powerful one. Extractors and their variants have found widespread application in a variety of areas, including pseudorandomness and derandomization, combinatorics, cryptography, data structures, and computational complexity. Equally striking has b...

Journal: :Journal of Computer and System Sciences 2011

2015
Ariel Gabizon

Preface Roughly speaking, a deterministic extractor is a function that 'extracts' almost perfect random bits from a 'weak random source'-a distribution that contains some entropy but is far from being truly random. In this book we explicitly construct deterministic extractors and related objects for various types of sources. A basic theme in this book is a methodology of recycling randomness th...

2012
Joshua Adams Joseph Shelton Lasanio Small Sabra Neal Melissa Venable Jung Hee Kim Gerry V. Dozier

This paper presents a novel approach to feature extraction for face recognition. This approach extends a previously developed method that incorporated the feature extraction techniques of GEFE ML (Genetic and Evolutionary Feature Extraction – Machine Learning) and Darwinian Feature Extraction). The feature extractors evolved by GEFE ML are superior to traditional feature extraction methods in t...

Journal: :Theoretical Computer Science 2012

Journal: :International Journal of Chemical Engineering 2012

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید