Sciweavers

5316 search results - page 368 / 1064
» Which Search Problems Are Random
Sort
View
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 7 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky
CORR
2007
Springer
136views Education» more  CORR 2007»
15 years 7 months ago
Sparsity in time-frequency representations
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
Götz E. Pfander, Holger Rauhut
MP
2006
107views more  MP 2006»
15 years 7 months ago
Optimality conditions in portfolio analysis with general deviation measures
Optimality conditions are derived for problems of minimizing a general measure of deviation of a random variable, with special attention to situations where the random variable cou...
R. Tyrrell Rockafellar, Stan Uryasev, Michael Zaba...
211
Voted
PTS
2010
134views Hardware» more  PTS 2010»
15 years 5 months ago
A Learning-Based Approach to Unit Testing of Numerical Software
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
Karl Meinke, Fei Niu
TIT
2008
90views more  TIT 2008»
15 years 7 months ago
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
Asaf Cohen, Tsachy Weissman, Neri Merhav