5624 search results - page 326 / 1125 » On Conditional Covering Problem |
168
click to vote
NIPS
2003
15 years 8 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
161
click to vote
AMW
2009
15 years 7 months ago
2009
Abstract. This paper introduces a formalization of a set of spatial semantic integrity constraints on an extended-relational database model. The formalization extends traditional n...
195
click to vote
ORL
2008
15 years 6 months ago
2008
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
155
click to vote
SIAMJO
2002
15 years 6 months ago
2002
The paper deals with the calmness of a class of multifunctions in finite dimensions. Its first part is devoted to various conditions for calmness, which are derived in terms of cod...
194
click to vote
TIT
2002
15 years 6 months ago
2002
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...