Sciweavers

2715 search results - page 179 / 543
» Total Generalized Variation
Sort
View
SIAMCO
2002
89views more  SIAMCO 2002»
15 years 3 months ago
Convexity in Zero-Sum Differential Games
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...
Rafal Goebel
ACL
2010
15 years 1 months ago
The Importance of Rule Restrictions in CCG
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...
Marco Kuhlmann, Alexander Koller, Giorgio Satta
CDC
2009
IEEE
227views Control Systems» more  CDC 2009»
15 years 1 months ago
Reduced-order observer design using a Lagrangian method
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...
Mark Mutsaers, Siep Weiland, Richard Engelaar
150
Voted
DICTA
2009
15 years 1 months ago
Refining Local 3D Feature Matching through Geometric Consistency for Robust Biometric Recognition
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...
Syed M. S. Islam, Rowan Davies
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 3 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
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...