Author:
Jegelka Stefanie,Kapoor Ashish,Horvitz Eric
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Software
Reference41 articles.
1. Caetano, T., McAuley, J., Cheng, L., Le, Q., & Smola, A. (2009). Learning graph matching. In IEEE Trans. on Pattern Analysis and Machine Intelligence (pp. 2349–2374).
2. Chegireddy, C. R., & Hamacher, H. W. (1987). Algorithms for finding $$k$$ k -best perfect matchings. Discrete Applied Mathematics, 18, 155–165.
3. Chli, M., & Davison, A. J. (2008). Active matching. In European Conference on Computer Vision (ECCV) 2008, Part I. Lecture Note in Computer Science (Vol. 5302, pp. 72–85). Heidelberg: Springer.
4. Cho, Y., Lee, J., & Lee, K. M. (2010). Reweighted random walks for graph matching. In European Conference on Computer Vision (ECCV).
5. Chvatal, V. (1979). A greedy heuristic for the set covering problem. Math of Operations Research, 4(3), 233–235.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献