Sciweavers

3270 search results - page 45 / 654
» Approximate String Processing
Sort
View
LICS
2003
IEEE
14 years 28 days ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
JSAC
2006
172views more  JSAC 2006»
13 years 7 months ago
A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection
The ability to inspect both packet headers and payloads to identify attack signatures makes network intrusion detection system (NIDS) a promising approach to protect Internet syste...
Hongbin Lu, Kai Zheng, Bin Liu, Xin Zhang, Y. Liu
SEKE
2010
Springer
13 years 6 months ago
A String Constraint Solver for Detecting Web Application Vulnerability
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
Xiang Fu, Chung-Chih Li
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 2 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
SIGIR
2009
ACM
14 years 2 months ago
Experiments in CLIR using fuzzy string search based on surface similarity
Cross Language Information Retrieval (CLIR) between languages of the same origin is an interesting topic of research. The similarity of the writing systems used for these language...
Sethuramalingam Subramaniam, Anil Kumar Singh, Pra...