Sciweavers

237 search results - page 11 / 48
» Practical and Optimal String Matching
Sort
View
ICS
2010
Tsinghua U.
14 years 3 months ago
Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
Jamin Naghmouchi, Daniele Paolo Scarpazza, Mladen ...
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
14 years 4 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
15 years 7 days ago
Validating Multi-column Schema Matchings by Type
Validation of multi-column schema matchings is essential for successful database integration. This task is especially difficult when the databases to be integrated contain little o...
Bing Tian Dai, Nick Koudas, Divesh Srivastava, Ant...
CANS
2006
Springer
83views Cryptology» more  CANS 2006»
14 years 2 months ago
Efficient Mutual Data Authentication Using Manually Authenticated Strings
Abstract. Solutions for an easy and secure setup of a wireless connection between two devices are urgently needed for WLAN, Wireless USB, Bluetooth and similar standards for short ...
Sven Laur, Kaisa Nyberg
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 9 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen