62 search results - page 5 / 13 » A Self-stabilizing K-Clustering Algorithm Using an Arbitrary... |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures of their physical infrastructure, resulting from physical attacks (su...
JMLR
2012
11 years 10 months ago
2012
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...