Parameterized algorithms for stable matching with ties and incomplete lists.
Deeksha AdilSushmita GuptaSanjukta RoySaket SaurabhMeirav ZehaviPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- learning algorithm
- computational complexity
- graph theory
- noisy data
- worst case
- data sets
- benchmark datasets
- orders of magnitude
- pattern matching
- theoretical analysis
- object matching
- recently developed
- times faster
- computational efficiency
- computationally efficient
- feature points
- computational cost
- computer vision
- machine learning