5595 search results - page 308 / 1119 » Approximation Algorithms for Clustering Problems |
185
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
166
Voted
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
189
click to vote
SODA
2004
ACM
15 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...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
162
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...