Sciweavers

352 search results - page 3 / 71
» A local search approximation algorithm for k-means clusterin...
Sort
View
ICASSP
2011
IEEE
13 years 3 months ago
Non-flat clustering whith alpha-divergences
The scope of the well-known k-means algorithm has been broadly extended with some recent results: first, the k- means++ initialization method gives some approximation guarantees...
Olivier Schwander, Frank Nielsen
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 7 months ago
Approximate local search in combinatorial optimization
srn.com/abstract=423560
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
IAT
2009
IEEE
14 years 27 days ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
RIAO
2007
13 years 7 months ago
Comprehensible and Accurate Cluster Labels in Text Clustering
The purpose of text clustering in information retrieval is to discover groups of semantically related documents. Accurate and comprehensible cluster descriptions (labels) let the ...
Jerzy Stefanowski, Dawid Weiss
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 6 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi