478 search results - page 14 / 96 » Improving probability bounds by optimization over subsets |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
ICA
2007
Springer
14 years 1 months ago
2007
Springer
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
TASLP
2002
13 years 7 months ago
2002
Two approaches are proposed for the design of tied-mixture hidden Markov models (TMHMM). One approach improves parameter sharing via partial tying of TMHMM states. To facilitate ty...
SAGA
2009
Springer
14 years 2 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...