메뉴 건너뛰기




Volumn , Issue , 2001, Pages 71-75

Enterprise text processing: A sparse matrix approach

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FEEDBACK; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; TEXT PROCESSING;

EID: 84961839082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITCC.2001.918768     Document Type: Conference Paper
Times cited : (10)

References (10)
  • 1
    • 84961847385 scopus 로고    scopus 로고
    • BLAST Forum, http://www.netlib.org/blast/blast-forum, 1999.
    • (1999) BLAST Forum
  • 2
    • 0010248759 scopus 로고    scopus 로고
    • Efficiency Considerations in Very Large Information Retrieval Servers
    • British Computer Society
    • O. Frieder, D. Grossman, A. Chowdhury, and G. Frieder, Efficiency Considerations in Very Large Information Retrieval Servers, Journal of Digital Information, (British Computer Society), 1(5).
    • Journal of Digital Information , vol.1 , Issue.5
    • Frieder, O.1    Grossman, D.2    Chowdhury, A.3    Frieder, G.4
  • 4
    • 84961803591 scopus 로고    scopus 로고
    • On the Implementation of Information Retrieval as Sparse Matrix Application
    • N. Goharian, T. El-Ghazawi. D. Grossman, On the Implementation of Information Retrieval as Sparse Matrix Application, PDPTA'99.
    • PDPTA'99
    • Goharian, N.1    El-Ghazawi, T.2    Grossman, D.3
  • 6
    • 0026381244 scopus 로고    scopus 로고
    • Sparse matrix vector multiplication technique on the IBM 3090 VP
    • Peters, Sparse matrix vector multiplication technique on the IBM 3090 VP, Parallel Computing 17.
    • Parallel Computing , vol.17
    • Peters1
  • 8
    • 0039686121 scopus 로고    scopus 로고
    • Parallel querying of large databases: A case study
    • H. Stone, Parallel querying of large databases: A case study, IEEE Computer.
    • IEEE Computer
    • Stone, H.1
  • 9
    • 84961846925 scopus 로고    scopus 로고
    • www.hti.umich.edu/relig/kjv/prox.html


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