메뉴 건너뛰기




Volumn , Issue , 2006, Pages 3492-3497

A dynamical systems approach to weighted graph matching

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER VISION; DISTRIBUTED PARAMETER CONTROL SYSTEMS; GRAPH THEORY; PROBLEM SOLVING;

EID: 39549114868     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2006.377633     Document Type: Conference Paper
Times cited : (12)

References (21)
  • 1
    • 0002412868 scopus 로고
    • Dynamical Systems that Sort Lists, Diagonalize Matrices and Solve Linear Programming Problems
    • R.W. Brockett. Dynamical Systems that Sort Lists, Diagonalize Matrices and Solve Linear Programming Problems, Linear Algebra and Its Applications, 146 (1991), pp. 79-91
    • (1991) Linear Algebra and Its Applications , vol.146 , pp. 79-91
    • Brockett, R.W.1
  • 3
    • 0025474861 scopus 로고
    • The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
    • Moody T. Chu and K. R. Driessel. The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints, SIAM Journal on Numerical Analysis, 27 (1990), pp. 1050-1060
    • (1990) SIAM Journal on Numerical Analysis , vol.27 , pp. 1050-1060
    • Chu, M.T.1    Driessel, K.R.2
  • 4
    • 0346928644 scopus 로고
    • Matrix Differential Equations: A Continuous Realization Process for Linear Algebra Problems
    • Moody T. Chu. Matrix Differential Equations: A Continuous Realization Process for Linear Algebra Problems, Nonlinear Analysis, 18 (1992), pp. 1125-1146
    • (1992) Nonlinear Analysis , vol.18 , pp. 1125-1146
    • Chu, M.T.1
  • 7
  • 9
    • 27144520265 scopus 로고    scopus 로고
    • Alain Faye and Frederic Roupin. A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem, In ESA 2005, 3-6 Octobre, Majorque, Espagne. LNCS 3669, pp. 850-861, 2005. (ref. CEDRIC 835).
    • Alain Faye and Frederic Roupin. A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem, In ESA 2005, 3-6 Octobre, Majorque, Espagne. LNCS 3669, pp. 850-861, 2005. (ref. CEDRIC 835).
  • 10
    • 33749558115 scopus 로고    scopus 로고
    • Semidefinite Programming Approaches to the Quadratic Assignment Problem, Nonlinear Assignment Problems: Algorithms and Applications
    • Kluwer Academic Publishers
    • Henry Wolkowicz. Semidefinite Programming Approaches to the Quadratic Assignment Problem, Nonlinear Assignment Problems: Algorithms and Applications, Combinatorial Optimization Series, 7, 143-174, Kluwer Academic Publishers, 2000.
    • (2000) Combinatorial Optimization Series , vol.7 , pp. 143-174
    • Wolkowicz, H.1
  • 11
    • 16244402704 scopus 로고    scopus 로고
    • On State-dependent Dynamic Graphs and their Controllability Properties
    • Mehran Mesbahi. On State-dependent Dynamic Graphs and their Controllability Properties, IEEE Transactions on Automatic Control (50) 3: 387-392, 2005.
    • (2005) IEEE Transactions on Automatic Control (50) , vol.3 , pp. 387-392
    • Mesbahi, M.1
  • 14
    • 0038548185 scopus 로고    scopus 로고
    • Coordination of Groups of Mobile Autonomous Agents using Nearest Neighbor Rules
    • A. Jadbabaie, J. Lin and A. S. Morse. Coordination of Groups of Mobile Autonomous Agents using Nearest Neighbor Rules, IEEE Transactions on Automatic Control, (48) 6: 988-1001, 2003.
    • (2003) IEEE Transactions on Automatic Control, (48) , vol.6 , pp. 988-1001
    • Jadbabaie, A.1    Lin, J.2    Morse, A.S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.