메뉴 건너뛰기




Volumn 2003-May, Issue , 2003, Pages 227-235

An optimal algorithm for MoJo distance

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; POLYNOMIAL APPROXIMATION;

EID: 84979072993     PISSN: 10928138     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPC.2003.1199206     Document Type: Conference Paper
Times cited : (49)

References (17)
  • 1
    • 0141469637 scopus 로고    scopus 로고
    • File clustering using naming conventions for legacy systems
    • Nov
    • N. Anquetil and T. Lethbridge. File clustering using naming conventions for legacy systems. In Proceedings of CASCON 1997, pages 184-195, Nov. 1997.
    • (1997) Proceedings of CASCON 1997 , pp. 184-195
    • Anquetil, N.1    Lethbridge, T.2
  • 4
    • 0025226963 scopus 로고
    • Extracting and restructuring the design of large systems
    • Jan
    • S. C. Choi and W. Scacchi. Extracting and restructuring the design of large systems. IEEE Software, pages 66-71, Jan. 1990.
    • (1990) IEEE Software , pp. 66-71
    • Choi, S.C.1    Scacchi, W.2
  • 13
    • 18044387672 scopus 로고    scopus 로고
    • Ph.D. Thesis, Department of Computer Science, University of Toronto, July
    • V. Tzerpos. Comprehension-driven software clustering. Ph.D. Thesis, Department of Computer Science, University of Toronto, July 2001.
    • (2001) Comprehension-driven Software Clustering
    • Tzerpos, V.1


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