153 search results - page 17 / 31 » On the Optimal Compression of Sets in PSPACE |
160
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The large number of spectral variables in most data sets encountered in spectral chemometrics often renders the prediction of a dependent variable uneasy. The number of variables ...
145
click to vote
ATVA
2009
Springer
16 years 17 days ago
2009
Springer
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
177
click to vote
IAT
2005
IEEE
15 years 11 months ago
2005
IEEE
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
150
click to vote
SIAMSC
2010
15 years 4 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
156
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...