Sciweavers

1028 search results - page 36 / 206
» Character sets of strings
Sort
View
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
13 years 11 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
ICDE
2004
IEEE
85views Database» more  ICDE 2004»
14 years 9 months ago
Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem
Queries with (equality or LIKE) selection predicates over string attributes are widely used in relational databases. However, state-of-the-art techniques for estimating selectivit...
Surajit Chaudhuri, Venkatesh Ganti, Luis Gravano
STRINGOLOGY
2008
13 years 9 months ago
On the Uniform Distribution of Strings
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
Sébastien Rebecchi, Jean-Michel Jolion
ICDAR
2005
IEEE
14 years 1 months ago
Text Degradations and OCR Training
Printing and scanning of text documents introduces degradations to the characters which can be modeled. Interestingly, certain combinations of the parameters that govern the degra...
Elisa H. Barney Smith, Tim L. Andersen
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti