메뉴 건너뛰기




Volumn 5666 LNCS, Issue , 2009, Pages 109-121

Efficient algorithms for string-based negative selection

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION SCHEME; EFFICIENT ALGORITHM; EXPONENTIAL TIME; NEGATIVE SELECTION; POLYNOMIAL-TIME; RUNNING TIME;

EID: 70350342307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03246-2_14     Document Type: Conference Paper
Times cited : (14)

References (9)
  • 4
    • 70350294161 scopus 로고    scopus 로고
    • Stibor, T.: On the Appropriateness of Negative Selection for Anomaly Detection and Network Intrusion Detection. Ph.D thesis, Darmstadt University of Technology (2006)
    • Stibor, T.: On the Appropriateness of Negative Selection for Anomaly Detection and Network Intrusion Detection. Ph.D thesis, Darmstadt University of Technology (2006)
  • 8
    • 0001704377 scopus 로고
    • On-line construction of suffix-trees
    • Ukkonen, E.: On-line construction of suffix-trees. Algorithmica 14(3), 249-260 (1995)
    • (1995) Algorithmica , vol.14 , Issue.3 , pp. 249-260
    • Ukkonen, E.1
  • 9
    • 38149134428 scopus 로고    scopus 로고
    • Stibor, T.: Phase transition and the computational complexity of generating r-contiguous detectors. In: de Castro, L.N., Von Zuben, F.J., Knidel, H. (eds.) ICARIS 2007. LNCS, 4628, pp. 142-155. Springer, Heidelberg (2007)
    • Stibor, T.: Phase transition and the computational complexity of generating r-contiguous detectors. In: de Castro, L.N., Von Zuben, F.J., Knidel, H. (eds.) ICARIS 2007. LNCS, vol. 4628, pp. 142-155. Springer, Heidelberg (2007)


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