메뉴 건너뛰기




Volumn 3120, Issue , 2004, Pages 210-223

Learning a hidden graph using O(log n) queries per edge

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY; LEARNING SYSTEMS; PROBABILITY; PROBLEM SOLVING; QUERY LANGUAGES; C (PROGRAMMING LANGUAGE); LEARNING ALGORITHMS;

EID: 9444267793     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-27819-1_15     Document Type: Conference Paper
Times cited : (19)

References (6)
  • 3
    • 0034833407 scopus 로고    scopus 로고
    • An optimal procedure for gap closing in whole genome shotgun sequencing
    • Beigel, R., Alon, N., Kasif, S., Apaydin, M.S., Fortnow, L.: An optimal procedure for gap closing in whole genome shotgun sequencing. In: RECOMB. (2001) 22-30
    • (2001) RECOMB , pp. 22-30
    • Beigel, R.1    Alon, N.2    Kasif, S.3    Apaydin, M.S.4    Fortnow, L.5
  • 5


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