Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms.
Daniel DadushSantosh S. VempalaPublished in: SODA (2012)
Keyphrases
- recently developed
- computational cost
- computationally efficient
- neural network
- data mining
- orders of magnitude
- databases
- randomized algorithms
- times faster
- significant improvement
- learning algorithm
- database
- worst case
- optimization problems
- least squares
- benchmark datasets
- dynamic programming
- data mining algorithms
- computationally expensive