Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
The classical Matrosov theorem concludes uniform asymptotic stability of time varying systems via a weak Lyapunov function (positive definite, decrescent, with negative semidefi...
Functional approximation of scattered data is a popular technique for compactly representing various types of datasets in computer graphics, including surface, volume, and vector ...
Yun Jang, Ralf P. Botchen, Andreas Lauser, David S...
This paper describes how the Erlang programming language could be extended with parameterized modules, in a way that is compatible with existing code. This provides a powerful way...
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...