Sciweavers

5595 search results - page 67 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
193
Voted
TKDE
2012
270views Formal Methods» more  TKDE 2012»
13 years 7 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
WEA
2004
Springer
107views Algorithms» more  WEA 2004»
15 years 10 months ago
An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation
Clustering can be used to identify groups of similar solutions in Multimodal Optimisation. However, a poor clustering quality reduces the benefit of this application. The vast maj...
Pedro J. Ballester, Jonathan N. Carter
STOC
2002
ACM
84views Algorithms» more  STOC 2002»
16 years 4 months ago
Random sampling and approximation of MAX-CSP problems
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...
ICDCN
2009
Springer
15 years 9 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
127
Voted
PODC
2006
ACM
15 years 10 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju