Information Computing and Applications
暂无分享,去创建一个
Alfred Kobsa | Moni Naor | Josef Kittler | John C. Mitchell | John C. Mitchell | M. Naor | J. Kittler | A. Kobsa
[1] Brad L. Hutchings,et al. Assisting network intrusion detection with reconfigurable hardware , 2002, Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.
[2] Yeim-Kuan Chang,et al. The Cost Effective Pre-processing Based NFA Pattern Matching Architecture for NIDS , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.
[3] Fred S. Roberts,et al. T-colorings of graphs: recent results and open problems , 1991, Discret. Math..
[4] Tutut Herawan,et al. On Cloud Computing Security Issues , 2012, ACIIDS.
[5] Robert Janczewski. Greedy T-colorings of graphs , 2009, Discret. Math..
[6] S. Hedetniemi,et al. On the hamiltonian completion problem , 1974 .
[7] John W. Lockwood,et al. Implementation of a content-scanning module for an Internet firewall , 2003, 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2003. FCCM 2003..
[8] Mustafa Mat Deris,et al. SMARViz: Soft Maximal Association Rules Visualization , 2009, IVIC.
[9] Wen-Jyi Hwang,et al. High throughput and low area cost FPGA‐based signature match circuit for network intrusion detection , 2009 .
[10] John W. Lockwood,et al. Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.
[11] Panos M. Pardalos,et al. Frequency Assignment Problems , 1999, Handbook of Combinatorial Optimization.
[12] Enrico Malaguti,et al. The Vertex Coloring Problem and its generalizations , 2009, 4OR.
[13] Ming Ye,et al. Novel Protocol Model Design of Wireless Sensor Real-Time Control Network , 2011 .
[14] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[15] Josep Paradells,et al. Frequency assignments in IEEE 802.11 WLANs with efficient spectrum sharing , 2009 .
[16] Barry A. Tesman. List T-Colorings of Graphs , 1993, Discret. Appl. Math..
[17] Mustafa Mat Deris,et al. Extracting highly positive association rules from students’ enrollment data , 2011 .
[18] Tutut Herawan,et al. Mining Interesting Association Rules of Students Suffering Study Anxieties Using SLP-Growth Algorithm , 2012, Int. J. Knowl. Syst. Sci..
[19] Jeffrey D. Ullman,et al. The compilation of regular expressions into integrated circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[20] T. V. Lakshman,et al. Gigabit rate packet pattern-matching using TCAM , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..
[21] Christopher R. Clark,et al. Scalable pattern matching for high speed networks , 2004, 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.
[22] Viktor K. Prasanna,et al. Fast Regular Expression Matching Using FPGAs , 2001, The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01).
[23] Habiba Drias,et al. Two hybrid ant algorithms for the general T-colouring problem , 2010, Int. J. Bio Inspired Comput..
[24] John W. Lockwood,et al. Internet Worm and Virus Protection in Dynamically Reconfigurable Hardware , 2003 .
[25] Tutut Herawan,et al. Replication Techniques in Data Grid Environments , 2012, ACIIDS.
[26] Tutut Herawan,et al. Mining Interesting Association Rules of Student Suffering Mathematics Anxiety , 2011, ICSECS.
[27] Vangelis Th. Paschos,et al. On the Maximum Edge Coloring Problem , 2009, WAOA.
[28] J. A. McHugh,et al. On covering the points of a graph with point disjoint paths , 1974 .
[29] Mustafa Mat Deris,et al. Mining significant association rules from educational data using critical relative support approach , 2011 .
[30] Dionisios N. Pnevmatikatos,et al. Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System , 2003, FPL.
[31] Lawrence Middlekamp. UHF Taboos-History and Development , 1978, IEEE Transactions on Consumer Electronics.