On Derandomizing Probabilistic Sublinear-Time Algorithms.
Marius ZimandPublished in: Computational Complexity Conference (2007)
Keyphrases
- learning algorithm
- computationally efficient
- theoretical analysis
- orders of magnitude
- real time
- data structure
- computational complexity
- computational cost
- worst case
- optimization problems
- computational efficiency
- data mining algorithms
- exact and approximate
- recently developed
- computationally expensive
- classification algorithm
- benchmark datasets
- search engine
- information retrieval
- neural network