2252 search results - page 134 / 451 » Lower Bounds for Dynamic Algorithms |
127
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
113
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper, we present new results in performance analysis of super-resolution (SR) image reconstruction. We investigate bounds on the improvement in resolution that can be ach...
123
click to vote
ALT
2008
Springer
16 years 9 days ago
2008
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
119
click to vote
COLT
1999
Springer
15 years 7 months ago
1999
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
159
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...