EUCLIDEAN MATCHING PROBLEMS AND THE METROPOLIS ALGORITHM.

被引：0
|
作者：
Weber, M. [1 ]
Liebling, Th.M. [1 ]
机构：
[1] EPF-Lausanne, Lausanne, Switz, EPF-Lausanne, Lausanne, Switz
来源：
| 1600年 / 30期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
OPTIMIZATION
引用
收藏
相关论文
共 50 条
  • [1] A simple and efficient template matching algorithm.
    Jurie, F
    Dhome, M
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL II, PROCEEDINGS, 2001, : 544 - 549
  • [2] ON OPTIMAL MATCHING MEASURES FOR MATCHING PROBLEMS RELATED TO THE EUCLIDEAN DISTANCE
    Manuel Mazon, Jose
    Daniel Rossi, Julio
    Toledo, Julian
    MATHEMATICA BOHEMICA, 2014, 139 (04): : 553 - 566
  • [3] Comparing mean field and Euclidean matching problems
    J. Houdayer
    J.H. Boutet de Monvel
    O.C. Martin
    The European Physical Journal B - Condensed Matter and Complex Systems, 1998, 6 : 383 - 393
  • [4] Comparing mean field and Euclidean matching problems
    Houdayer, J
    de Monvel, JHB
    Martin, OC
    EUROPEAN PHYSICAL JOURNAL B, 1998, 6 (03): : 383 - 393
  • [5] Random Euclidean matching problems in one dimension
    Caracciolo, Sergio
    D'Achille, Matteo
    Sicuro, Gabriele
    PHYSICAL REVIEW E, 2017, 96 (04)
  • [6] A PARTITIONING ALGORITHM FOR MINIMUM WEIGHTED EUCLIDEAN MATCHING
    DYER, ME
    FRIEZE, AM
    INFORMATION PROCESSING LETTERS, 1984, 18 (02) : 59 - 62
  • [7] 'Epitope matching', the must addition in pre-transplant algorithm.
    Rahalkar, Dhanashree
    Dwyer, Karen
    Ujvari, Beata
    Saxena, Shailaja
    Kapat, Arnab
    Sarang, Shabari
    TRANSPLANTATION, 2024, 108 (09) : 531 - 531
  • [8] 'Epitope matching', the must addition in pre-transplant algorithm.
    Rahalkar, Dhanashree
    Dwyer, Karen
    Ujvari, Beata
    Saxena, Shailaja
    Kapat, Arnab
    Sarang, Shabari
    TRANSPLANTATION, 2024, 108 (9S)
  • [9] A linear time randomized approximation algorithm for Euclidean matching
    Imanparast, Mandi
    Hashemi, Seyed Naser
    JOURNAL OF SUPERCOMPUTING, 2019, 75 (05): : 2648 - 2664
  • [10] A linear time randomized approximation algorithm for Euclidean matching
    Mahdi Imanparast
    Seyed Naser Hashemi
    The Journal of Supercomputing, 2019, 75 : 2648 - 2664
12345