Sciweavers

20 search results - page 2 / 4
» An Augmented Primal-Dual Method for Linear Conic Programs
Sort
View
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
CVPR
2011
IEEE
13 years 1 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
PDPTA
1996
13 years 6 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
ICRA
2010
IEEE
100views Robotics» more  ICRA 2010»
13 years 3 months ago
Weighted barrier functions for computation of force distributions with friction cone constraints
— We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction c...
Per Henrik Borgstrom, Maxim A. Batalin, Gaurav S. ...
GLVLSI
2006
IEEE
185views VLSI» more  GLVLSI 2006»
13 years 11 months ago
Application of fast SOCP based statistical sizing in the microprocessor design flow
In this paper we have applied statistical sizing in an industrial setting. Efficient implementation of the statistical sizing algorithm is achieved by utilizing a dedicated interi...
Murari Mani, Mahesh Sharma, Michael Orshansky