A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
: The emphasis in the published literature has mostly been on symmetry as the critical source for beauty judgment. In fact, both symmetry and asymmetry serve as highly aesthetic so...
We present a shape-based algorithm for detecting and
recognizing non-rigid objects from natural images. The existing
literature in this domain often cannot model the objects
ver...
Xiang Bai, Xinggang Wang, Longin Jan Latecki, Weny...