Sciweavers

5115 search results - page 71 / 1023
» On Randomized Lanczos Algorithms
Sort
View
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
15 years 5 months ago
Computationally Private Randomizing Polynomials and Their Applications
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 2 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
16 years 7 days ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan
IPPS
2000
IEEE
15 years 4 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco