Sciweavers

1996 search results - page 121 / 400
» A decision procedure for linear
Sort
View
RC
2007
113views more  RC 2007»
15 years 5 months ago
A Search Algorithm for Calculating Validated Reliability Bounds
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
Fulvio Tonon
CVPR
2004
IEEE
16 years 8 months ago
Self-Normalized Linear Tests
Making decisions based on a linear combination L of features is of course very common in pattern recognition. For distinguishing between two hypotheses or classes, the test is of ...
Sachin Gangaputra, Donald Geman
NIPS
2007
15 years 7 months ago
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
Ambuj Tewari, Peter L. Bartlett
ENTCS
2008
102views more  ENTCS 2008»
15 years 6 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
TIT
2002
121views more  TIT 2002»
15 years 6 months ago
Asymptotic normality of linear multiuser receiver outputs
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
Dongning Guo, Sergio Verdú, Lars K. Rasmuss...