4894 search results - page 545 / 979 » The Guarding Problem - Complexity and Approximation |
141
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
138
Voted
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...
146
click to vote
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
The selection of features for classification, clustering and approximation is an important task in pattern recognition, data mining and soft computing. For real-valued features, th...
141
click to vote
JMLR
2010
14 years 11 months ago
2010
We consider the Bellman residual minimization approach for solving discounted Markov decision problems, where we assume that a generative model of the dynamics and rewards is avai...
120
Voted
NHM
2010
14 years 11 months ago
2010
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...