Round Compression for Parallel Matching Algorithms.
Artur CzumajJakub LackiAleksander MadrySlobodan MitrovicKrzysztof OnakPiotr SankowskiPublished in: SIAM J. Comput. (2020)
Keyphrases
- computational cost
- theoretical analysis
- orders of magnitude
- significant improvement
- worst case
- computationally efficient
- learning algorithm
- matching algorithm
- stereo correspondence
- benchmark datasets
- parallel hardware
- parallel processors
- parallel implementation
- compression scheme
- times faster
- keypoints
- wavelet transform
- computational complexity
- data structure