( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Detection of New Malicious Code Using N-grams Signatures.

, , , и . PST, стр. 193-196. (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mohamed Ahmed Tony Ahmed Marzok

Hans-Peter Tony

Tony Franken

Tony Noll

Tony Mudrack

 

Другие публикации лиц с тем же именем

Focused ranking in a vertical search engine., и . SIGIR, стр. 912. ACM, (2007)Towards the Theory of Relaxed Unification., , и . ISMIS, том 2871 из Lecture Notes in Computer Science, стр. 397-401. Springer, (2003)Combating Spamdexing: Incorporating Heuristics in Link-Based Ranking., и . WAW, том 4936 из Lecture Notes in Computer Science, стр. 97-106. Springer, (2006)DalTREC 2006 QA System Jellyfish: Regular Expressions Mark-and-Match Approach to Question Answering., , и . TREC, том 500-272 из NIST Special Publication, National Institute of Standards and Technology (NIST), (2006)Relaxed unification--Proposal., и . Appl. Math. Lett., 16 (5): 747-751 (2003)A Probabilistic Evaluation Function for Relaxed Unification., , и . COMPSAC (2), стр. 35-36. IEEE Computer Society, (2005)0-7695-2413-3.Detection of New Malicious Code Using N-grams Signatures., , , и . PST, стр. 193-196. (2004)DalTREC 2005 QA System Jellyfish: Mark-and-Match Approach to Question Answering., , , , и . TREC, том 500-266 из NIST Special Publication, National Institute of Standards and Technology (NIST), (2005)N-Gram-Based Detection of New Malicious Code., , , и . COMPSAC Workshops, стр. 41-42. IEEE Computer Society, (2004)0-7695-2209-2.Relaxed Unification - Proposal., и . AI, том 2338 из Lecture Notes in Computer Science, стр. 364-365. Springer, (2002)