2489 search results - page 195 / 498 » On the Subgroup Distance Problem |
132
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Affinity functions are the core components in negative selection to discriminate self from non-self. It has been shown that affinity functions such as the r-contiguous distance an...
122
Voted
CLASSIFICATION
2008
15 years 4 months ago
2008
: In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the ama...
125
click to vote
IJCV
2006
15 years 4 months ago
2006
We address the issue of low-level segmentation of vector-valued images, focusing on the case of color natural images. The proposed approach relies on the formulation of the problem...
119
click to vote
TSMC
2008
15 years 4 months ago
2008
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
145
click to vote
PR
1998
15 years 4 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...