135 search results - page 5 / 27 » Approximability Distance in the Space of H-Colourability Pro... |
TKDE
2008
13 years 7 months ago
2008
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
TALG
2010
13 years 2 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...