Sciweavers

3250 search results - page 71 / 650
» An Algorithm to Solve a Linear Program
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
PC
2002
118views Management» more  PC 2002»
14 years 9 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
PC
2010
145views Management» more  PC 2010»
14 years 8 months ago
GPU computing with Kaczmarz's and other iterative algorithms for linear systems
The graphics processing unit (GPU) is used to solve large linear systems derived from partial differential equations. The differential equations studied are strongly convection-...
Joseph M. Elble, Nikolaos V. Sahinidis, Panagiotis...
IPPS
2005
IEEE
15 years 3 months ago
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...
Jacques M. Bahi, Raphaël Couturier
PAMI
2007
176views more  PAMI 2007»
14 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas