Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
Daniel DadushSantosh S. VempalaPublished in: CoRR (2011)
Keyphrases
- data structure
- database
- learning algorithm
- computationally expensive
- computational complexity
- theoretical analysis
- orders of magnitude
- times faster
- deterministic finite automata
- exact computation
- randomized algorithm
- exact and approximate
- approximate solutions
- graph theory
- recently developed
- optimization problems
- computational cost
- significant improvement
- search algorithm
- machine learning
- databases