391 search results - page 2 / 79 » Constructive Equivalence Relations on Computable Probability... |
JAT
2006
13 years 4 months ago
2006
We construct a measure such that if {pn(z)} is the sequence of orthogonal polynomials relative to that measure, then the Riemann Hypothesis with simple zeros is true if and only if...
JMLR
2006
13 years 4 months ago
2006
Kernels are two-placed functions that can be interpreted as inner products in some Hilbert space. It is this property which makes kernels predestinated to carry linear models of l...
PEPM
2010
ACM
14 years 1 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
ISIPTA
2003
IEEE
13 years 10 months ago
2003
IEEE
We adopt the same mathematical model of a set M of probability measures as is central to the theory of coherent imprecise probability. However, we endow this model with an objecti...
ICML
1996
IEEE
14 years 5 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...