On the complexity of distributed stable matching with small messages.
Alexander KipnisBoaz Patt-ShamirPublished in: Distributed Comput. (2010)
Keyphrases
- matching algorithm
- small number
- cooperative
- image matching
- graph matching
- distributed systems
- matching process
- feature points
- space complexity
- database
- distributed computing
- motion estimation
- computational complexity
- computer vision
- worst case
- pattern matching
- search algorithm
- distributed environment
- fault tolerant
- shape matching
- social networks
- learning algorithm
- neural network