Implicit Decomposition for Write-Efficient Connectivity Algorithms.
Naama Ben-DavidGuy E. BlellochJeremy T. FinemanPhillip B. GibbonsYan GuCharles McGuffeyJulian ShunPublished in: CoRR (2017)
Keyphrases
- computationally efficient
- computationally expensive
- optimization problems
- real time
- parallel architectures
- highly scalable
- computationally intensive
- times faster
- theoretical analysis
- learning algorithm
- orders of magnitude
- computational cost
- efficient implementation
- algorithmic solutions
- limited memory
- efficient solutions
- computationally complex
- combinatorial optimization
- binary images
- image processing
- machine learning
- databases