1028 search results - page 88 / 206 » Character sets of strings |
121
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
131
click to vote
CICLING
2007
Springer
15 years 9 months ago
2007
Springer
Although the literature contains reports of very high accuracy figures for the recognition of named entities in text, there are still some named entity phenomena that remain probl...
89
Voted
DAM
2007
15 years 2 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
122
Voted
EMNLP
2009
15 years 21 days ago
2009
We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Co...
134
Voted
JACM
2007
15 years 2 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...