메뉴 건너뛰기




Volumn 36, Issue 8, 2000, Pages 719-720

Robust multi-view correspondence of noisy 2D points using relaxation

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBABILITY; SIGNAL FILTERING AND PREDICTION;

EID: 0033885671     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20000553     Document Type: Article
Times cited : (1)

References (4)
  • 1
    • 0040758090 scopus 로고    scopus 로고
    • Performance analysis for dynamic tree embedding in k-partite networks by a random walk
    • HONG, SHEN, LI, K., PAN, Y., YOUNG, G.H., and ZHENG, S.Q.: 'Performance analysis for dynamic tree embedding in k-partite networks by a random walk', J. Parallel Distributed Comput., 1998, 50, pp. 144-156
    • (1998) J. Parallel Distributed Comput. , vol.50 , pp. 144-156
    • Hong, S.1    Li, K.2    Pan, Y.3    Young, G.H.4    Zheng, S.Q.5


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