On derandomizing algorithms that err extremely rarely.
Oded GoldreichAvi WigdersonPublished in: STOC (2014)
Keyphrases
- website
- optimization problems
- computationally efficient
- computational cost
- learning algorithm
- orders of magnitude
- benchmark datasets
- theoretical analysis
- computational efficiency
- computationally expensive
- multiscale
- decision trees
- efficient implementation
- social networks
- real time
- combinatorial optimization
- recently developed
- graph theory
- data mining algorithms
- worst case
- significant improvement
- query processing
- pairwise
- image processing
- artificial intelligence