835 search results - page 133 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
NIPS
2008
14 years 11 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
TON
2012
13 years 3 days ago
2012
—Multiparty interactive network applications such as teleconferencing, network gaming, and online trading are gaining popularity. In addition to end-to-end latency bounds, these ...
SPAA
1990
ACM
15 years 1 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
SIAMDM
2002
14 years 9 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...