922 search results - page 26 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...
113
click to vote
CIE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
106
click to vote
TARK
2007
Springer
15 years 8 months ago
2007
Springer
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
116
click to vote
ISIPTA
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper argues in favor of the thesis that two different concepts of conditional interval probability are needed, in order to serve the huge variety of tasks conditional probab...
110
click to vote
ICFP
1999
ACM
15 years 6 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...