Sciweavers

21 search results - page 4 / 5
» Properties of the Log-Barrier Function on Degenerate Nonline...
Sort
View
POPL
2009
ACM
14 years 8 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
MP
2002
195views more  MP 2002»
13 years 7 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 7 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
ICCV
2003
IEEE
14 years 9 months ago
View-invariant Alignment and Matching of Video Sequences
In this paper, we propose a novel method to establish temporal correspondence between the frames of two videos. 3D epipolar geometry is used to eliminate the distortion generated ...
Cen Rao, Alexei Gritai, Mubarak Shah, Tanveer Fath...
IOR
2007
89views more  IOR 2007»
13 years 7 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...