Sciweavers

321 search results - page 21 / 65
» Randomness extractors -- applications and constructions
Sort
View
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
14 years 4 days ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
14 years 1 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
ESANN
2007
13 years 10 months ago
An overview of reservoir computing: theory, applications and implementations
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
Benjamin Schrauwen, David Verstraeten, Jan M. Van ...
SDM
2007
SIAM
133views Data Mining» more  SDM 2007»
13 years 10 months ago
On Point Sampling Versus Space Sampling for Dimensionality Reduction
In recent years, random projection has been used as a valuable tool for performing dimensionality reduction of high dimensional data. Starting with the seminal work of Johnson and...
Charu C. Aggarwal
ECCC
1998
105views more  ECCC 1998»
13 years 8 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan