Sciweavers

4430 search results - page 139 / 886
» Solving Optimization Problems with DLL
Sort
View
COCOA
2008
Springer
15 years 5 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
CCCG
2010
15 years 4 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
IWPEC
2004
Springer
15 years 8 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 5 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
AMC
2007
125views more  AMC 2007»
15 years 3 months ago
Geometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
Stephen L. Keeling, Gundolf Haase