88 search results - page 5 / 18 » Improved Bounds and Schemes for the Declustering Problem |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
ICRA
2010
IEEE
13 years 5 months ago
2010
IEEE
— Cable robots have seen considerable recent interest ensuing from their ability to combine a large workspace with significant payload capacity. However, the cables can apply for...
JMLR
2002
13 years 6 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...