Sciweavers

Share
ECCC
2011
213views ECommerce» more  ECCC 2011»
8 years 3 months ago
Extractors for circuit sources
Emanuele Viola
ECCC
2011
204views ECommerce» more  ECCC 2011»
8 years 3 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
ECCC
2011
187views ECommerce» more  ECCC 2011»
8 years 3 months ago
In Brute-Force Search of Correlation Bounds for Polynomials
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...
Frederic Green, Daniel Kreymer, Emanuele Viola
ECCC
2011
203views ECommerce» more  ECCC 2011»
8 years 3 months ago
Accelerated Slide- and LLL-Reduction
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
Claus-Peter Schnorr
ECCC
2011
171views ECommerce» more  ECCC 2011»
8 years 3 months ago
Testing Linear Properties: Some general themes
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
Madhu Sudan
ECCC
2011
206views ECommerce» more  ECCC 2011»
8 years 3 months ago
On the Degree of Univariate Polynomials Over the Integers
We study the following problem raised by von zur Gathen and Roche [GR97]: What is the minimal degree of a nonconstant polynomial f : {0, . . . , n} → {0, . . . , m}?
Gil Cohen, Amir Shpilka, Avishay Tal
EC
2011
216views ECommerce» more  EC 2011»
8 years 3 months ago
Abandoning Objectives: Evolution Through the Search for Novelty Alone
man and Kenneth O. Stanley (2010). Revising the Evolutionary Computation Abstraction: Minimal Criteria Novelty Search. In: Proceedings of the Genetic and Evolutionary Computation C...
Joel Lehman, Kenneth O. Stanley
ECCC
2011
282views ECommerce» more  ECCC 2011»
8 years 6 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
ECOI
2011
240views ECommerce» more  ECOI 2011»
8 years 6 months ago
HerbariaViz: A web-based client-server interface for mapping and exploring flora observation data
The potential for physical flora collections to support scientific research is being enhanced by rapid development of digital databases that represent characteristics of the physic...
Tom Auer, Alan M. MacEachren, Craig McCabe, Scott ...
ECEASST
2010
8 years 7 months ago
A Feature Model for an IDE4OCL
An Integrated OCL Development Environment (IDE4OCL) can significantly improve the pragmatics and practice of OCL. Therefore we started a comprehensive requirement analysis with the...
Joanna Dobroslawa Chimiak-Opoka, Birgit Demuth
books