Sciweavers

530 search results - page 40 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
CDC
2008
IEEE
124views Control Systems» more  CDC 2008»
14 years 3 months ago
A proximal center-based decomposition method for multi-agent convex optimization
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
Ion Necoara, Johan A. K. Suykens
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
14 years 1 months ago
Event-based control using quadratic approximate value functions
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
Randy Cogill
CVPR
2007
IEEE
14 years 11 months ago
Progressive Finite Newton Approach To Real-time Nonrigid Surface Detection
Detecting nonrigid surfaces is an interesting research problem for computer vision and image analysis. One important challenge of nonrigid surface detection is how to register a n...
Jianke Zhu, Michael R. Lyu
CVPR
2005
IEEE
14 years 11 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
COR
2007
112views more  COR 2007»
13 years 8 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...