598 search results - page 28 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
SODA
2000
ACM
13 years 9 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
TAMC
2009
Springer
14 years 3 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
IPMI
2011
Springer
12 years 12 months ago
2011
Springer
This paper proposes a novel method for computing linear basis images from tensor-valued image data. As a generalization of the nonnegative matrix factorization, the proposed method...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...