A new approach to two-player zero-sum differential games with convex-concave cost function is presented. It employs the tools of convex and variational analysis. A necessary and s...
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...
This paper considers the problem of reduced-order observer design. A design procedure is proposed in which the impulse response of the observer is treated as the solution of a gene...
Local features are gaining popularity due to their robustness to occlusion and other variations such as minor deformation. However, using local features for recognition of biometri...
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...