(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings.
Shang-En HuangHsin-Hao SuPublished in: CoRR (2022)
Keyphrases
- approximate matching
- distributed systems
- distributed processing
- master slave
- distributed environment
- parallel data mining
- bipartite graph matching
- pattern matching
- matching algorithm
- matching process
- parallel processing
- cooperative
- parallel database systems
- load balance
- parallel execution
- association graph
- worst case
- multiple independent
- computer vision
- shape matching
- image matching
- lower bound
- distributed data
- massively parallel
- graph matching
- peer to peer
- single processor
- image registration
- total weight
- feature points
- lightweight
- keypoints
- string matching
- maximum number
- computing environments