1677 search results - page 31 / 336 » On the Completeness of Quantum Computation Models |
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
103
click to vote
COCO
2003
Springer
15 years 6 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
We consider the problem of calibrating a highly generic imaging model, that consists of a non-parametric association of a projection ray in 3D to every pixel in an image. Previous...
103
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
112
click to vote
RIVF
2007
15 years 2 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...