1717 search results - page 96 / 344 » A Computable Spectral Theorem |
133
click to vote
MPC
1995
Springer
15 years 7 months ago
1995
Springer
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
119
click to vote
ICIP
1999
IEEE
16 years 5 months ago
1999
IEEE
A classical approach to interpolation of sampled data is polynomial interpolation. However, from the sampling theorem it follows that the ideal approach to interpolation is to con...
122
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper, we present a comparison theorem for the solutions of two generalized algebraic Riccati equations (GAREs) coming from two different systems. We show that the so-c...
147
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
154
click to vote
GFKL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...