5595 search results - page 168 / 1119 » Approximation Algorithms for Clustering Problems |
168
click to vote
SBCCI
2003
ACM
15 years 10 months ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
193
click to vote
ALGOSENSORS
2006
Springer
15 years 8 months ago
2006
Springer
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
203
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
162
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
148
Voted
STOC
1998
ACM
15 years 9 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...