In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
In order to regulate different circumstances over an extensive period of time, norms in institutions are stated in a vague and biguous manner, thereby abstracting from concrete as...
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
This article describes an ontological model of norms. The basic assumption is that a substantial part of a legal system is grounded on the concept of agency. Since a legal system a...