2489 search results - page 172 / 498 » On the Subgroup Distance Problem |
119
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
150
Voted
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
123
click to vote
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
123
click to vote
PG
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we consider the problem of reconstructing triangular surfaces from given contours. An algorithm solving this problem has to decide which contours of two successive s...
138
click to vote
ESA
2000
Springer
15 years 8 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...