Sciweavers

14165 search results - page 362 / 2833
» The generalized two-server problem
Sort
View
CORR
2011
Springer
206views Education» more  CORR 2011»
15 years 1 months ago
Convergence analysis of a proximal Gauss-Newton method
Abstract An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Co...
Saverio Salzo, Silvia Villa
SIAMIS
2011
15 years 1 months ago
Continuous Primal-Dual Methods for Image Processing
In this article we study a continuous Primal-Dual method proposed by Appleton and Talbot and generalize it to other problems in image processing. We interpret it as an Arrow-Hurwi...
M. Goldman
JMLR
2010
128views more  JMLR 2010»
15 years 1 months ago
Learning Causal Structure from Overlapping Variable Sets
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
Sofia Triantafilou, Ioannis Tsamardinos, Ioannis G...
JMLR
2010
151views more  JMLR 2010»
15 years 1 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
MICS
2010
124views more  MICS 2010»
15 years 1 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger