Sciweavers

15033 search results - page 410 / 3007
» Complexity Theory and Algorithms
Sort
View
ICASSP
2008
IEEE
16 years 2 months ago
Iteratively reweighted algorithms for compressive sensing
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...
Rick Chartrand, Wotao Yin
MLQ
1998
61views more  MLQ 1998»
15 years 7 months ago
Extracting Algorithms from Intuitionistic Proofs
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 ...
Fernando Ferreira, António Marques

Lecture Notes
357views
17 years 6 months ago
Online Mechanisms
in Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani (eds.), Chapter 16, Cambrige University Press, 2007
David Parkes
ALT
2008
Springer
16 years 4 months ago
Prequential Randomness
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...
Vladimir Vovk, Alexander Shen
IJSR
2011
74views more  IJSR 2011»
15 years 2 months ago
Acting Deceptively: Providing Robots with the Capacity for Deception
Deception is utilized by a variety of intelligent systems ranging from insects to human beings. It has been argued that the use of deception is an indicator of theory of mind [2] ...
Alan R. Wagner, Ronald C. Arkin