516 search results - page 27 / 104 » Sets of k-Independent Strings |
PAMI
2002
14 years 10 months ago
2002
This paper describes a handwritten character string recognition system for Japanese mail address reading on very large vocabulary. The address phrases are recognized as a whole bec...
101
click to vote
STACS
2009
Springer
15 years 5 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
AIME
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. We report on the design of a system for correcting spelling errors resulting in non-existent words. The system aims at improving edition of medical reports. Unlike tradit...
MST
2006
14 years 11 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
105
click to vote
HCI
2011
14 years 2 months ago
2011
By mapping messages into a large context, we can compute the distances between them, and then classify them. We test this conjecture on Twitter messages: Messages are mapped onto t...