13987 search results - page 180 / 2798 » The Two Guards Problem |
185
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
174
click to vote
CCR
2005
15 years 6 months ago
2005
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
124
click to vote
EPIA
2009
Springer
16 years 1 months ago
2009
Springer
In order to automatically identify noun synonyms, we propose a new idea which opposes classical polysemous representations of words to monosemous representations based on the “on...
154
click to vote
GBRPR
2007
Springer
16 years 21 days ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
151
click to vote
SPIRE
2005
Springer
16 years 11 hour ago
2005
Springer
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing th...