2489 search results - page 154 / 498 » On the Subgroup Distance Problem |
161
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
192
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Linear Discriminant Analysis (LDA) is a popular tool for multiclass discriminative dimensionality reduction. However, LDA suffers from two major problems: (1) It only optimizes th...
190
click to vote
ISMIR
2004
Springer
16 years 7 days ago
2004
Springer
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
219
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
180
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...