Sciweavers

49 search results - page 4 / 10
» Bounded functional interpretation and feasible analysis
Sort
View
CISS
2008
IEEE
15 years 4 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
LICS
2003
IEEE
15 years 2 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
ICPR
2004
IEEE
15 years 10 months ago
Motion Analysis Using Frame Differences with Spatial Gradient Measures
The paper considers making inferences about the underlying true 2-D motion when only evaluations of a local block-based cost function, the mean of absolute or squared differences,...
Pekka Sangi, Janne Heikkilä, Olli Silvé...
AUTOMATICA
2007
110views more  AUTOMATICA 2007»
14 years 9 months ago
Stability analysis of systems with uncertain time-varying delays
Stability in presence of bounded uncertain time-varying delays in the feedback loop of a system is studied. The delay parameter is assumed to be an unknown time-varying function f...
Chung-Yao Kao, Anders Rantzer
UAI
2003
14 years 11 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...