Sciweavers

2168 search results - page 74 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
JMLR
2010
99views more  JMLR 2010»
14 years 9 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
ECCV
2002
Springer
16 years 4 months ago
A Probabilistic Theory of Occupancy and Emptiness
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...
Rahul Bhotika, David J. Fleet, Kiriakos N. Kutulak...
ICIP
2008
IEEE
16 years 4 months ago
Nonconvex compressive sensing and reconstruction of gradient-sparse images: Random vs. tomographic Fourier sampling
Previous compressive sensing papers have considered the example of recovering an image with sparse gradient from a surprisingly small number of samples of its Fourier transform. T...
Rick Chartrand
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 3 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
ENTCS
2007
108views more  ENTCS 2007»
15 years 3 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...