5595 search results - page 162 / 1119 » Approximation Algorithms for Clustering Problems |
113
click to vote
ECML
2003
Springer
15 years 10 months ago
2003
Springer
We consider the topographic clustering task and focus on the problem of its evaluation, which enables to perform model selection: topographic clustering algorithms, from the origin...
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
269
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
152
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
137
Voted
AAAI
2008
15 years 7 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...