478 search results - page 22 / 96 » A simple expected running time analysis for randomized |
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
AC
2003
Springer
14 years 1 months ago
2003
Springer
Concentration inequalities deal with deviations of functions of independent random variables from their expectation. In the last decade new tools have been introduced making it pos...
ALGORITHMICA
2007
13 years 8 months ago
2007
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—In this paper, a novel error probability analysis of orthogonal space-time block coding (OSTBC) over independent but not necessarily identical Hoyt (Nakagami-q) fading channels ...