3192 search results - page 299 / 639 » The minimum latency problem |
182
click to vote
NIPS
2001
15 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
192
click to vote
IJCAI
2003
15 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
151
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper deals with clustering of spatially distributed data using wireless sensor networks. A distributed low-complexity clustering algorithm is developed that requires one-hop...
145
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
153
click to vote
IEICET
2006
15 years 6 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...