Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
We consider the problem of channel sharing by rate adaptive streams belonging to various classes. The performance measure per class is the average scaled bandwidth allocated to co...
Abstract--In this paper, we present an unequal power allocation technique to increase the throughput of code-division multiple-access (CDMA) systems with chip-level interleavers. P...
Abstract--We describe a vibratory part transport mechanism that utilizes both static and dynamic friction to linearly transport parts in a horizontal direction. We derive a horizon...