106 search results - page 16 / 22 » An Improved Algorithm for Optimal Bin Packing |
STOC
1996
ACM
14 years 6 days ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Online spectrum auctions offer ample flexibility for bidders to request and obtain spectrum on-the-fly. Such flexibility, however, opens up new vulnerabilities to bidder mani...
ICIC
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...