2489 search results - page 193 / 498 » On the Subgroup Distance Problem |
144
click to vote
WABI
2001
Springer
15 years 9 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
133
click to vote
ICPPW
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract. We address the problem of Quality of Service (QoS) requirements for multimedia applications (e.g., distance education, telemedicine, electronic commerce). These applicati...
155
click to vote
COMPGEOM
2000
ACM
15 years 9 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
133
click to vote
ECTEL
2006
Springer
15 years 8 months ago
2006
Springer
This article describes a study of distance collaborative activities that have been conducted in a cross-national setting between a Greek and a German university. We discuss issues ...
252
click to vote
AIPRF
2008
15 years 6 months ago
2008
Despite outstanding successes of the state-of-the-art clustering algorithms, many of them still suffer from shortcomings. Mainly, these algorithms do not capture coherency and homo...