메뉴 건너뛰기




Volumn 4649 LNCS, Issue , 2007, Pages 227-236

Maximal intersection queries in randomized graph models

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SET THEORY;

EID: 37249086627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74510-5_24     Document Type: Conference Paper
Times cited : (3)

References (10)
  • 1
    • 0025403933 scopus 로고
    • The hardness of decoding linear codes with preprocessing
    • Bruck, J., Naor, M.: The hardness of decoding linear codes with preprocessing. IEEE Transactions on Information Theory 36(2), 381-385 (1990)
    • (1990) IEEE Transactions on Information Theory , vol.36 , Issue.2 , pp. 381-385
    • Bruck, J.1    Naor, M.2
  • 2
    • 4544388794 scopus 로고    scopus 로고
    • Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: STOC '04, pp. 91-100 (2004)
    • Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: STOC '04, pp. 91-100 (2004)
  • 3
    • 0030714233 scopus 로고    scopus 로고
    • Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: STOC '97, pp. 599-608 (1997)
    • Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: STOC '97, pp. 599-608 (1997)
  • 4
    • 37249016226 scopus 로고    scopus 로고
    • Materials of mini-course at Stuttgart University , Available at
    • Lifshits, Y.: A Guide to Web Research. Materials of mini-course at Stuttgart University (2007), Available at http://logic.pdmi.ras. ru/~ yura/webguide.html
    • (2007) A Guide to Web Research
    • Lifshits, Y.1
  • 5
    • 27144440080 scopus 로고    scopus 로고
    • A new method for approximate indexing and dictionary lookup with one error
    • Maa ß, M.G., Nowak, J.: A new method for approximate indexing and dictionary lookup with one error. Inf. Process. Lett. 96(5), 185-191 (2005)
    • (2005) Inf. Process. Lett , vol.96 , Issue.5 , pp. 185-191
    • Maa ß, M.G.1    Nowak, J.2
  • 7
    • 0038718854 scopus 로고    scopus 로고
    • The structure and function of complex networks
    • Newman, M.: The structure and function of complex networks. SIAM Review 45(2), 167-256 (2003)
    • (2003) SIAM Review , vol.45 , Issue.2 , pp. 167-256
    • Newman, M.1
  • 9
    • 0027188633 scopus 로고    scopus 로고
    • Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA '93, pp. 311-321 (1993)
    • Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA '93, pp. 311-321 (1993)
  • 10
    • 33747729581 scopus 로고    scopus 로고
    • Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv. 38(2), 6 (Article No.) (2006)
    • Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv. 38(2), 6 (Article No.) (2006)


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