메뉴 건너뛰기




Volumn , Issue , 1998, Pages 12-19

Selecting good keys for triangle-inequality-based pruning algorithms

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT BASED RETRIEVAL; DATABASE SYSTEMS; VIDEO RECORDING;

EID: 85030146307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CAIVD.1998.646029     Document Type: Conference Paper
Times cited : (11)

References (11)
  • 3
    • 0004085224 scopus 로고
    • Technical Report 1994-03-02, Dept. of Computer Science, University of Washington
    • A. Berman. A new data structure for fast approximate matching. Technical Report 1994-03-02, Dept. of Computer Science, University of Washington, 1994.
    • (1994) A New Data Structure for Fast Approximate Matching
    • Berman, A.1
  • 6
    • 0015531930 scopus 로고
    • Some approaches to best-match file searching
    • Apr
    • W. A. Burkhard and R. M. Keller. Some approaches to best-match file searching. Communications of the ACM, 16(4):230-236, Apr 1973.
    • (1973) Communications of the ACM , vol.16 , Issue.4 , pp. 230-236
    • Burkhard, W.A.1    Keller, R.M.2
  • 10
    • 0026256261 scopus 로고
    • Satisfying general proxim- ity/similarity queries with metric trees
    • J. Uhlmann, Satisfying general proxim- ity/similarity queries with metric trees. Information Processing Letters, 40, 1991, pages 175-179.
    • (1991) Information Processing Letters , vol.40 , pp. 175-179
    • Uhlmann, J.1
  • 11
    • 0025631742 scopus 로고
    • Texture classification using texture spectrum
    • L. Wang and D. C. He. Texture classification using texture spectrum. Pattern Recognition Lett., 13, 1990, pages 905-910.
    • (1990) Pattern Recognition Lett , vol.13 , pp. 905-910
    • Wang, L.1    He, D.C.2


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