3270 search results - page 29 / 654 » Approximate String Processing |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
HOTOS
2007
IEEE
15 years 1 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
ACL
2012
13 years 8 days ago
2012
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...