Sciweavers

1028 search results - page 12 / 206
» Character sets of strings
Sort
View
AIRS
2004
Springer
14 years 28 days ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
CIKM
2001
Springer
14 years 1 days 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...
ICAPR
2005
Springer
14 years 1 months ago
A Novel Approach for Text Detection in Images Using Structural Features
We propose a novel approach for finding text in images by using ridges at several scales. A text string is modelled by a ridge at a coarse scale representing its center line and n...
H. Tran, Augustin Lux, H. L. Nguyen T, A. Boucher
ICDAR
2003
IEEE
14 years 24 days ago
Using Character Recognition and Segmentation to Tell Computer from Humans
How do you tell a computer from a human? The situation arises often on the Internet, when online polls are conducted, accounts are requested, undesired email is received, and chat...
Patrice Y. Simard, Richard Szeliski, Josh Benaloh,...
TCS
2008
13 years 7 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang