5595 search results - page 183 / 1119 » Approximation Algorithms for Clustering Problems |
177
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
140
click to vote
ICMCS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper a new approach for face clustering is developed. Mutual information and joint entropy are exploited in order to create a metric for the clustering process. The way t...
122
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Each clustering algorithm induces a similarity between given data points, according to the underlying clustering criteria. Given the large number of available clustering technique...
133
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
147
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...