Sciweavers

986 search results - page 1 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
MP
2002
85views more  MP 2002»
13 years 4 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
ICCV
2007
IEEE
13 years 8 months ago
Efficient Generic Calibration Method for General Cameras with Single Centre of Projection
Generic camera calibration is a non-parametric calibration technique that is applicable to any type of vision sensor. However, the standard generic calibration method was develope...
Aubrey K. Dunne, John Mallon, Paul F. Whelan
PEPM
1995
ACM
13 years 8 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
MOR
2002
94views more  MOR 2002»
13 years 4 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 4 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev