20294 search results - page 311 / 4059 » Algorithmic Information Theory |
188
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
176
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
The theory of compressive sensing has shown that sparse signals can be reconstructed exactly from many fewer measurements than traditionally believed necessary. In [1], it was sho...
124
click to vote
MLQ
1998
15 years 6 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
202
Voted
Lecture Notes
in Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani (eds.), Chapter 16, Cambrige University Press, 2007
166
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...