2489 search results - page 108 / 498 » On the Subgroup Distance Problem |
126
click to vote
EOR
2007
15 years 3 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
132
Voted
AMC
2010
15 years 4 months ago
2010
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
164
click to vote
CP
2011
Springer
14 years 3 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
136
Voted
CORR
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
142
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...