Sciweavers

1028 search results - page 10 / 206
» Character sets of strings
Sort
View
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
13 years 12 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
MVA
1994
13 years 8 months ago
A Procedure for Segmenting Touching Numbers in Cadastral Maps
We present a procedure to split (or segment) touching numerals. We are neither assuming a dominant orientation for the text direction nor long character strings. The basic idea is...
Gladys Monagan
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
IVC
2008
101views more  IVC 2008»
13 years 7 months ago
A system for processing handwritten bank checks automatically
In the US and many other countries, bank checks are preprinted with the account number and the check number in MICR ink and format; as such, these two numeric fields can be easily...
Rafael Palacios, Amar Gupta
SCP
2010
163views more  SCP 2010»
13 years 2 months ago
Compact and efficient strings for Java
In several Java VMs, strings consist of two separate objects: metadata such as the string length are stored in the actual string object, while the string characters are stored in ...
Christian Häubl, Christian Wimmer, Hanspeter ...