1717 search results - page 284 / 344 » A Computable Spectral Theorem |
102
Voted
CORR
2000
Springer
15 years 10 days ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
103
click to vote
ECCC
2000
15 years 10 days ago
2000
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
85
Voted
CORR
2010
Springer
15 years 3 days ago
2010
Springer
The convergence problem of the Laplace-Beltrami operators plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial diff...
113
Voted
ECCV
2010
Springer
14 years 11 months ago
2010
Springer
Compressive sampling (CS) is aimed at acquiring a signal or image from data which is deemed insufficient by Nyquist/Shannon sampling theorem. Its main idea is to recover a signal ...
117
Voted
JACM
2010
14 years 11 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...