메뉴 건너뛰기




Volumn 8691 LNCS, Issue PART 3, 2014, Pages 613-627

Optimizing ranking measures for compact binary code learning

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING;

EID: 84906495994     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-10578-9_40     Document Type: Conference Paper
Times cited : (15)

References (27)
  • 4
  • 27
    • 0031345518 scopus 로고    scopus 로고
    • Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
    • Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM T. Math. Softw. (1997)
    • (1997) ACM T. Math. Softw.
    • Zhu, C.1    Byrd, R.H.2    Lu, P.3    Nocedal, J.4


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