1717 search results - page 95 / 344 » A Computable Spectral Theorem |
154
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
177
click to vote
ICLP
1994
Springer
15 years 8 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
143
click to vote
CCS
2004
ACM
15 years 9 months ago
2004
ACM
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
130
click to vote
KI
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
123
click to vote
FOSSACS
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...