1717 search results - page 112 / 344 » A Computable Spectral Theorem |
128
click to vote
EUC
2005
Springer
15 years 10 months ago
2005
Springer
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
128
click to vote
GCC
2003
Springer
15 years 9 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
125
click to vote
ICFP
1999
ACM
15 years 8 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
103
click to vote
CAGD
2006
15 years 4 months ago
2006
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
178
click to vote
ENTCS
2006
15 years 4 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...