Sciweavers

1517 search results - page 60 / 304
» New Approach To A Class Of Matrices
Sort
View
SOFSEM
2010
Springer
15 years 10 months ago
Improved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
Pierre Courtieu, Gladys Gbedo, Olivier Pons
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 6 months ago
The nullspace method - a unifying paradigm to fault detection
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
András Varga
COMPSAC
2009
IEEE
15 years 6 months ago
Towards a Next-Generation Matrix Library for Java
Matrices are essential in many fields of computer science, especially when large amounts of data must be handled efficiently. Despite this demand for matrix software, we were una...
Holger Arndt, Markus Bundschus, Andreas Naegele
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 1 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
RC
2002
96views more  RC 2002»
15 years 1 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz