Sciweavers

563 search results - page 56 / 113
» Computing approximate PSD factorizations
Sort
View
LICS
2007
IEEE
14 years 4 months ago
Limits of Multi-Discounted Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...
Hugo Gimbert, Wieslaw Zielonka
CVPR
2000
IEEE
14 years 12 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
JMLR
2010
129views more  JMLR 2010»
13 years 4 months ago
Expectation Truncation and the Benefits of Preselection In Training Generative Models
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
Jörg Lücke, Julian Eggert
ISCAS
2005
IEEE
125views Hardware» more  ISCAS 2005»
14 years 3 months ago
A novel algorithm of spatial scalability for scrambled video
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
YuanZhi Zou, Wen Gao
ORL
2008
90views more  ORL 2008»
13 years 10 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...