Sciweavers

153 search results - page 14 / 31
» On the Optimal Compression of Sets in PSPACE
Sort
View
FLAIRS
2008
15 years 1 months ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
TIP
2010
127views more  TIP 2010»
14 years 10 months ago
Bayesian Compressive Sensing Using Laplace Priors
In this paper we model the components of the compressive sensing (CS) problem, i.e., the signal acquisition process, the unknown signal coefficients and the model parameters for ...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
ASPLOS
1996
ACM
15 years 3 months ago
Analysis of Branch Prediction Via Data Compression
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge
TSP
2008
101views more  TSP 2008»
14 years 11 months ago
Bayesian Compressive Sensing
The data of interest are assumed to be represented as N-dimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signal can be recons...
Shihao Ji, Ya Xue, Lawrence Carin
LICS
2008
IEEE
15 years 5 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski