Search Results - "parallel string-matching algorithm"
-
1
Authors: K M M Rajashekharaiah
Source: International Journal of Distributed and Parallel systems. 3:21-28
-
2
Authors: et al.
Source: 2012 1st International Conference on Recent Advances in Information Technology (RAIT). :478-481
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
-
3
Authors: Jayadev Misra
Source: Information Processing Letters. 85:255-260
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
-
4
Authors: Kuo-Liang Chung
Source: Pattern Recognition Letters. 17:475-479
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Access URL: https://dblp.uni-trier.de/db/journals/prl/prl17.html#Chung96
https://ui.adsabs.harvard.edu/abs/1996PaReL..17..475C/abstract
https://www.sciencedirect.com/science/article/pii/0167865596000074
https://doi.org/10.1016/0167-8655(96)00007-4
http://dblp.uni-trier.de/db/journals/prl/prl17.html#Chung96 -
5
Authors: Zvi Galil
Source: Journal of the ACM. 42:908-918
Subject Terms: string matching, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, optimal parallel algorithm, pattern string, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/xml
Access URL: https://dl.acm.org/doi/10.1145/129712.129720
https://dblp.uni-trier.de/db/conf/stoc/stoc92.html#Galil92
https://dl.acm.org/citation.cfm?doid=129712.129720
https://doi.acm.org/10.1145/210332.210341
https://dl.acm.org/doi/10.1145/210332.210341
https://dblp.uni-trier.de/db/journals/jacm/jacm42.html#Galil95 -
6
Authors: et al.
Source: Communications in Computer and Information Science ISBN: 9783642357947
-
7
Authors:
Source: SIAM Journal on Computing. 19:1051-1058
Subject Terms: 4. Education, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Computer science, 01 natural sciences
Access URL: https://academiccommons.columbia.edu/doi/10.7916/D8BG2X2S/download
https://academiccommons.columbia.edu/doi/10.7916/D8HH6T6R
https://core.ac.uk/display/24315411
https://locus.siam.org/doi/abs/10.1137/0219072
https://academiccommons.columbia.edu/doi/10.7916/D8BG2X2S/download
https://doi.org/10.1137/0219072
https://epubs.siam.org/doi/10.1137/0219072 -
8
Authors: Galil, Zvi
Source: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ; page 69-76
-
9
Authors: 陳建麟
Thesis Advisors: 黃能富
File Description: 52
Availability: http://ndltd.ncl.edu.tw/handle/57773162720790226759
-
10
Authors:
Contributors:
File Description: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.6119; http://www.cs.columbia.edu/~dany/papers/sm.ps.Z
-
11
Authors: Galil, Zvi
Source: Journal of the Association for Computing Machinery. Jul95, Vol. 42 Issue 4, p908. 11p.
Subject Terms: *Algorithms
-
12
Authors:
Source: Journal of Algorithms. 16:295-308
Subject Terms: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, optimal speedup parallel string matching algorithm, Searching and sorting, 01 natural sciences
File Description: application/xml
-
13
Authors: et al.
Contributors: et al.
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1077.619; http://www.airccse.org/journal/ijdps/papers/0512ijdps03.pdf
-
14
Authors: et al.
Source: 2012 1st International Conference on Recent Advances in Information Technology (RAIT); 1/ 1/2012, p478-481, 4p
-
15
Authors:
Thesis Advisors:
File Description: 65
Availability: http://ndltd.ncl.edu.tw/handle/05922610396257830095
-
16
Authors:
Subject Terms: Computer science
Relation: https://doi.org/10.7916/D8HH6T6R
Availability: https://doi.org/10.7916/D8HH6T6R
-
17
Authors: et al.
Source: Trustworthy Computing & Services; 2013, p349-356, 8p
-
18
Authors:
Contributors:
Subject Terms: 字串比對
Time: 2
File Description: 155 bytes; text/html
Relation: [1] M. Roesch, “Snort – lightweight intrusion detection for networks,” 13th Systems Administradion Conference, pages 229-238, Nov. 1999. [2] A. Baratloo, N. Singh, and T. Tsai, “Transparent run-time defense against stack smashing attacks,” USENIX Security Symposium, June 2000. [3] “Current Trends in IDS and IPS,”[On-line]. http://www.networksecurityjournal.com/features/current-trends-in-ids-ips-052907 . [4] “Snort - the de facto Standard for Intrusion Detection/Prevention,” [On-line]. Available: www.snort.org [5] S. Antonatos, K. G. Anagostakis, and E. P. Markatos, “Generating realistic work loads for network intrusion detection systems.” ACM Workshop on Software and Performance, Redwood Shores, CA., USA, 2004. [6] A. V. Aho and M. J. Corasick, “Efficient string matching: and aid to bibliographic search,” Communications of ACM, 18(6):333-340, 1975. [7] M. Fisk and G. Varghese, “Fast content-based packet handling for intrusion detection,” UCSD Tech. Rep. CS2001-0670, 2001. [8] K. G. Anagnostakis, E. P. Markatos, S. Antonatos, and M. Polychronakis, “E2XB: A domain-specific string matching algorithm for intrusion detection,” 18th IFIP Int. Information Security Conference, Athens, Greece, 2003. [9] R. T. Liu, N. F. Huang, C. H. Chen, and C. N. Kao, “A fast string-match algorithm for network processor-based net work intrusion detection system,” ACM Transactions on. Embedded Computer Systems, Vol.3, pp.614-633, 2004. [10] C. R. Clark and D. E. Schimmel, “Scalable pattern matching for high speed networks,” IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM2004), Napa, CA, Apr.2004, pp. 249-257. [11] I. Sourdis and D. Pnevmatikatos. “Pre-decoded CAMs for efficient and high-speed NIDS pattern matching,” IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM2005), 2005. [12] Y. Sugwara, M. Inaba, and K. Hiraki. “Over 10 Gbps string matching mechanism for multi-stream packet scanning systems,” International Conference on Field Programmable Logic and Application, Antwerp, Belgium, Aug. 2004. [13] S. Yusuf and W. Luk, “Bitwise optimised CAM for network intrusion detection systems,” International Conference on Field Programmable Logic and Application, 2005, pp.444-449. [14] F. Yu, R. H. Katz, and T. V. Lakshman, “Gigabit rate packet pattern-matching using TCAM,” IEEE International Conference on Network Protocols, 2004, pp. 174-183. [15] N. Tuck, T. Sherwood, B. Calder, and G. Varghese, “Deterministic memory-efficient string matching algorithms for intrusion detection,” IEEE INFOCOM 2004, pp. 2628-2639. [16] L. Tan and T. Sherwood, “A high throughput string matching architecture for intrusion detection and prevention,” International. Symposium on Computer Architecture, 2005, pp. 112-122. [17] Y. H. Cho and W. H. Mangione-Smith, “A pattern matching coprocessor for network security,” IEEE DAC2005, Anaheim, CA, 2005. [18] S. Dharmapurikar and J. Lookwod, “Fast and scalable pattern matching for content filtering,” Symposium of Architecture and Network. Communication. Systems, Princeton, NJ, 2005. [19] Lu H B, Zheng K, Liu B, Zhang X, and Liu Y H, “A Memory-Efficient Parallel String Matching Architecture for High Speed Intrusion Detection, IEEE JSAC, Vol.24, No. 10, Oct. 2006, pp. 1793-1804. [20] B. Bloom, “Space/time trade-offs in hash coding with allowable errors,” Communications of. ACM, Vol. 13, pp. 422-426, May 1970. [21] Analog Bits Inc.,”High speed Ternary CAM Datasheet,” 2004.[On-line]. Available: http://www.analogbits.com/pdf/High_Speed_T_CAM_Datasheet.pdf; http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/30363
-
19
Authors:
Source: Department of Computer Science Technical Reports
Subject Terms: parallel string-matching algorithm, Computer Sciences, Analysis of algorithms and problem complexity, Distributed algorithms, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences
File Description: application/xml; application/pdf
Access URL: https://tidsskrift.dk/brics/article/download/19514/17135
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2085&context=cstech
https://tidsskrift.dk/brics/article/download/19514/17135
https://tidsskrift.dk/brics/article/view/19514
http://core.ac.uk/display/22612158
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp25.html#ApostolicoB96
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2085&context=cstech
https://docs.lib.purdue.edu/cstech/1086/
https://epubs.siam.org/doi/10.1137/S0097539793260404
http://docs.lib.purdue.edu/cstech/1086
http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2085&context=cstech -
20
Authors: et al.
Source: Network & Parallel Computing (9783540747833); 2007, p344-353, 10p
Nájsť tento článok vo Web of Science 
Full Text Finder