3096 search results - page 183 / 620 » The Generalized FITC Approximation |
138
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
119
Voted
CISS
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— An analytically tractable model for Gaussian multiuser channels with fading is studied, and the capacity region of this model is found to be a good approximation of the...
186
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
134
click to vote
ANOR
2002
15 years 4 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
115
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...