1778 search results - page 22 / 356 » On the Power of the Randomized Iterate |
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...
69
Voted
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
92
Voted
3DIM
2001
IEEE
15 years 1 months ago
2001
IEEE
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
CIE
2010
Springer
15 years 1 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...