2489 search results - page 321 / 498 » On the Subgroup Distance Problem |
145
click to vote
SODA
1992
ACM
15 years 5 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
140
click to vote
ADHOC
2007
15 years 4 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
137
click to vote
MST
2006
15 years 4 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
136
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
The problem of multi-robot patrol in adversarial environments has been gaining considerable interest during the recent years.In this problem, a team of mobile robots is required t...
157
click to vote
PVLDB
2010
15 years 2 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...