7 search results - page 2 / 2 » Optimal Spaced Seeds for Faster Approximate String Matching |
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
PODS
2000
ACM
13 years 10 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...