Sciweavers

1477 search results - page 33 / 296
» Random Convex Programs
Sort
View
SAS
1999
Springer
14 years 27 days ago
Polyhedral Analysis for Synchronous Languages
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
Frédéric Besson, Thomas P. Jensen, J...
CVPR
2010
IEEE
14 years 4 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
CDC
2009
IEEE
141views Control Systems» more  CDC 2009»
13 years 6 months ago
Cell design in bacteria as a convex optimization problem
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...
Anne Goelzer, Vincent Fromion, Gérard Scorl...
APPML
2010
91views more  APPML 2010»
13 years 8 months ago
Certificates of convexity for basic semi-algebraic sets
We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. The first one is based on a necessary and sufficient condition whereas the second one...
Jean B. Lasserre
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 6 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri