Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
Luis RademacherSantosh S. VempalaPublished in: CoRR (2006)
Keyphrases
- computational complexity
- theoretical analysis
- worst case
- computationally efficient
- complexity analysis
- learning algorithm
- recently developed
- computational cost
- neural network
- space complexity
- graph theory
- times faster
- optimization problems
- significant improvement
- data structure
- case study
- memory requirements
- machine learning
- real world
- real time
- randomized algorithms