Sciweavers

895 search results - page 140 / 179
» Approximate convex decomposition
Sort
View
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
15 years 2 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
81
Voted
MM
2010
ACM
177views Multimedia» more  MM 2010»
14 years 10 months ago
Image tag refinement towards low-rank, content-tag prior and error sparsity
The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incom...
Guangyu Zhu, Shuicheng Yan, Yi Ma
COMPUTING
2007
122views more  COMPUTING 2007»
14 years 9 months ago
Error estimation for Bregman iterations and inverse scale space methods in image restoration
In this paper we consider error estimation for image restoration problems based on generalized Bregman distances. This error estimation technique has been used to derive convergen...
Martin Burger, E. Resmerita, Lin He
JSAC
2008
111views more  JSAC 2008»
14 years 9 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
MP
2008
99views more  MP 2008»
14 years 9 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph