2489 search results - page 32 / 498 » On the Subgroup Distance Problem |
75
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
127
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
104
Voted
IPL
2008
15 years 25 days ago
2008
![Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time")
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
COMBINATORICS
2007
15 years 25 days ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
84
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...