421 search results - page 27 / 85 » String Distances and Uniformities |
119
Voted
NLPRS
2001
Springer
15 years 7 months ago
2001
Springer
This paper describes a method of extracting katakana words and phrases, along with their English counterparts from non-aligned monolingual web search engine query logs. The method...
129
click to vote
FOGA
2007
15 years 4 months ago
2007
Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined using the distance associated to the search space in ...
119
click to vote
EUROGP
2003
Springer
15 years 8 months ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
135
click to vote
CPM
2000
Springer
15 years 7 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
120
click to vote
GBRPR
2007
Springer
15 years 9 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...