922 search results - page 15 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
PLPV
2010
ACM
14 years 4 months ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— We consider the problem of small-gain analysis of asymptotic behavior in interconnected nonlinear dynamic systems. Mathematical models of these systems are allowed to be uncert...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
JAR
2000
13 years 7 months ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
IGPL
1998
13 years 7 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...