106 search results - page 16 / 22 » An Improved Algorithm for Optimal Bin Packing |
168
Voted
STOC
1996
ACM
15 years 9 months 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...
174
click to vote
INFOCOM
2011
IEEE
14 years 9 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...
172
click to vote
ICIC
2005
Springer
15 years 11 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...
152
Voted
INFOCOM
2010
IEEE
15 years 4 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...
118
Voted
FOCS
2009
IEEE
16 years 9 days 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 ...