Sciweavers

159 search results - page 12 / 32
» Chinese String Searching Using The KMP Algorithm
Sort
View
PPSN
1994
Springer
15 years 1 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
Günter Rudolph
75
Voted
COLING
2002
14 years 9 months ago
Structure Alignment Using Bilingual Chunking
A new statistical method called "bilingual chunking" for structure alignment is proposed. Different with the existing approaches which align hierarchical structures like...
Wei Wang, Ming Zhou, Jin-Xia Huang, Changning Huan...
80
Voted
CIKM
2001
Springer
15 years 2 months ago
Improved String Matching Under Noisy Channel Conditions
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
Kevyn Collins-Thompson, Charles Schweizer, Susan T...
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
15 years 1 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio
CORR
2008
Springer
128views Education» more  CORR 2008»
14 years 9 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov