478 search results - page 23 / 96 » Improving probability bounds by optimization over subsets |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious err...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— We consider power allocation algorithms for fixedrate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel stat...
DASFAA
2010
IEEE
13 years 11 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...