Obstruction-Free Algorithms Can Be Practically Wait-Free.
Faith Ellen FichVictor LuchangcoMark MoirNir ShavitPublished in: DISC (2005)
Keyphrases
- computational complexity
- database
- orders of magnitude
- computationally expensive
- computational cost
- data structure
- optimization problems
- neural network
- highly efficient
- efficient implementation
- convergence rate
- theoretical analysis
- computationally efficient
- worst case
- knn
- knowledge discovery
- significant improvement
- multiscale
- feature selection
- computer vision
- artificial intelligence
- information retrieval