Sciweavers

995 search results - page 125 / 199
» String Pattern Discovery
Sort
View
NETGAMES
2005
ACM
14 years 2 months ago
Dissecting server-discovery traffic patterns generated by multiplayer first person shooter games
We study the ‘background traffic’ resulting from tens of thousands of networked first person shooter (FPS) clients searching for servers on which to play. Networked, multiplay...
Sebastian Zander, David Kennedy, Grenville J. Armi...
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 2 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
AINA
2008
IEEE
14 years 3 months ago
Improved TCAM-Based Pre-Filtering for Network Intrusion Detection Systems
—With the increasing growth of the Internet, the explosion of attacks and viruses significantly affects the network security. Network Intrusion Detection System (NIDS) is develop...
Yeim-Kuan Chang, Ming-Li Tsai, Cheng-Chien Su
GBRPR
2007
Springer
14 years 3 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
JUCS
2010
130views more  JUCS 2010»
13 years 7 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han