Sciweavers

1092 search results - page 77 / 219
» Convex Methods for Transduction
Sort
View
PROCEDIA
2010
67views more  PROCEDIA 2010»
13 years 8 months ago
Using the feasible set method for rezoning in ALE
One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is ...
Markus Berndt, Milan Kucharik, Mikhail J. Shashkov
MP
2007
89views more  MP 2007»
13 years 9 months ago
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
Napsu Haarala, Kaisa Miettinen, Marko M. Mäke...
INTERSPEECH
2010
13 years 5 months ago
Reducing musical noise in blind source separation by time-domain sparse filters and split bregman method
Musical noise often arises in the outputs of time-frequency binary mask based blind source separation approaches. Postprocessing is desired to enhance the separation quality. An e...
Wenye Ma, Meng Yu, Jack Xin, Stanley Osher
ICASSP
2011
IEEE
13 years 1 months ago
Adaptive reconstruction method of missing textures based on perceptually optimized algorithm
This paper presents an adaptive reconstruction method of missing textures based on structural similarity (SSIM) index. The proposed method firstly performs SSIM-based selection o...
Takahiro Ogawa, Miki Haseyama
ICML
2009
IEEE
14 years 5 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye