2489 search results - page 56 / 498 » On the Subgroup Distance Problem |
120
Voted
AI
2008
Springer
15 years 5 months ago
2008
Springer
Distance semantics is a robust way of handling dynamically evolving and possibly contradictory information. In this paper we show that in many cases distance-based entailments can ...
123
Voted
PR
2007
15 years 3 months ago
2007
In previous papers [1, 2], we proposed a subspace distance. However, whether the subspace distance satisfies the triangle inequality was left open. In this note, we give positive ...
90
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We propose three distance measures for genetic search space. One is a distance measure in the population space that is useful for understanding the working mechanism of genetic al...
142
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
142
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...