Sciweavers

63 search results - page 8 / 13
» Iterative Operator-Splitting Methods for Stiff Problems in C...
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
TIP
2008
104views more  TIP 2008»
13 years 7 months ago
A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the 1 -norm of the wavelet coefficients of the solution. ...
Cédric Vonesch, Michael Unser
CVPR
2012
IEEE
11 years 9 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
CEC
2010
IEEE
13 years 8 months ago
Functionalization of microarray devices: Process optimization using a multiobjective PSO and multiresponse MARS modeling
An evolutionary approach for the optimization of microarray coatings produced via sol-gel chemistry is presented. The aim of the methodology is to face the challenging aspects of t...
Laura Villanova, Paolo Falcaro, Davide Carta, Iren...
JMLR
2010
121views more  JMLR 2010»
13 years 2 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor