-
1
-
-
0003515463
-
-
Prentice-Hall, Inc.
-
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., 1993.
-
(1993)
Network Flows: Theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orlin, J.B.3
-
2
-
-
0034819501
-
Local search heuristic for k-median and facility location problems
-
ACM
-
V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In Theory of computing, pages 21-29. ACM, 2001.
-
(2001)
Theory of Computing
, pp. 21-29
-
-
Arya, V.1
Garg, N.2
Khandekar, R.3
Meyerson, A.4
Munagala, K.5
Pandit, V.6
-
3
-
-
24644502276
-
Shape matching and object recognition using low distortion correspondences
-
A. Berg, T. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. In CVPR, pages 26-33, 2005.
-
(2005)
CVPR
, pp. 26-33
-
-
Berg, A.1
Berg, T.2
Malik, J.3
-
5
-
-
9644281592
-
Softposit: Simultaneous pose and correspondence determination
-
P. David, D. Dementhon, R. Duraiswami, and H. Samet. Softposit: Simultaneous pose and correspondence determination. IJCV, 59(3):259-284, 2004.
-
(2004)
IJCV
, vol.59
, Issue.3
, pp. 259-284
-
-
David, P.1
Dementhon, D.2
Duraiswami, R.3
Samet, H.4
-
6
-
-
84855348351
-
Fast approximate energy minization with label costs
-
A. Delong, A. Osokin, H. Isack, and Y. Boykov. Fast Approximate Energy Minization with Label Costs. IJCV, 96(1):1-27, 2012.
-
(2012)
IJCV
, vol.96
, Issue.1
, pp. 1-27
-
-
Delong, A.1
Osokin, A.2
Isack, H.3
Boykov, Y.4
-
7
-
-
0030125842
-
A graduated assignment algorithm for graph matching
-
S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. PAMI, 18(4):377-388, 1996.
-
(1996)
PAMI
, vol.18
, Issue.4
, pp. 377-388
-
-
Gold, S.1
Rangarajan, A.2
-
8
-
-
0001852170
-
An efficient implementation of a scaling minimum-cost flow algorithm
-
A. V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22:1-29, 1992.
-
(1992)
Journal of Algorithms
, vol.22
, pp. 1-29
-
-
Goldberg, A.V.1
-
10
-
-
84859270277
-
Energy-based geometric multi-model fitting
-
April
-
H. Isack and Y. Boykov. Energy-based geometric multi-model fitting. IJCV, 97(2), April 2012.
-
(2012)
IJCV
, vol.97
, pp. 2
-
-
Isack, H.1
Boykov, Y.2
-
12
-
-
33745886518
-
A spectral technique for correspondence problems using pairwise constraints
-
M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, pages 1482-1489, 2005.
-
(2005)
ICCV
, pp. 1482-1489
-
-
Leordeanu, M.1
Hebert, M.2
-
13
-
-
3042535216
-
Distinctive image features from scale-invariant keypoints
-
D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 2004.
-
(2004)
IJCV
-
-
Lowe, D.G.1
-
14
-
-
0041438862
-
A performance evaluation of local descriptors
-
K. Mikolajczyk and C. Schmid. A performance evaluation of local descriptors. In CVPR, volume 2, pages 257-263, 2003.
-
(2003)
CVPR
, vol.2
, pp. 257-263
-
-
Mikolajczyk, K.1
Schmid, C.2
-
15
-
-
78149346491
-
Combining geometric and appearance priors for robust homography estimation
-
E. Serradell, M. Ö zuysal, V. Lepetit, P. Fua, and F. Moreno-Noguer. Combining geometric and appearance priors for robust homography estimation. ECCV, pages 58-72, 2010.
-
(2010)
ECCV
, pp. 58-72
-
-
Serradell, E.1
Özuysal, M.2
Lepetit, V.3
Fua, P.4
Moreno-Noguer, F.5
-
16
-
-
84911388234
-
A dual decomposition approach to feature correspondence
-
PrePrint)
-
L. Torresani, V. Kolmogorov, and C. Rother. A dual decomposition approach to feature correspondence. PAMI, 99(PrePrint), 2012.
-
(2012)
PAMI
, vol.99
-
-
Torresani, L.1
Kolmogorov, V.2
Rother, C.3
|