Efficient Distributed Algorithms by Using the Archemedean Time Assumption.
Paul G. SpirakisBasil TampakasPublished in: STACS (1988)
Keyphrases
- computationally efficient
- data structure
- computationally expensive
- distributed systems
- computational complexity
- computational cost
- single pass
- computationally intensive
- highly efficient
- machine learning algorithms
- algorithmic solutions
- times faster
- orders of magnitude
- learning algorithm
- sensor networks
- significant improvement
- benchmark datasets
- peer to peer
- database systems
- pruning strategy
- space requirements
- feature selection