Sciweavers

322 search results - page 3 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 25 days ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 9 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
SIAMSC
2011
219views more  SIAMSC 2011»
13 years 23 days ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
13 years 11 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
C3S2E
2008
ACM
13 years 7 months ago
Integer least squares: sphere decoding and the LLL algorithm
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss...
Sanzheng Qiao