516 search results - page 16 / 104 » Sets of k-Independent Strings |
PR
1998
13 years 7 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
IJCNLP
2004
Springer
14 years 27 days ago
2004
Springer
In this paper we present a noun phrase coreference resolution system which aims to enhance the identification of the coreference realized by string matching. For this purpose, we ...
ICARIS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
EOR
2010
13 years 7 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
MFCS
2005
Springer
14 years 1 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...