Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Richard F. Bonner"'
Autor:
Richard F. Bonner, Rusins Freivalds
Publikováno v:
Theoretical Computer Science. 397:70-76
Freivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19–29] proved that probabilistic limited memory inductive inference machines can learn with probability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48541d8e5779e8ecd45ff50d1a3139a1
https://doi.org/10.1016/j.tcs.2008.02.023
https://doi.org/10.1016/j.tcs.2008.02.023
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 12:57-68
We introduce tensor product neural networks, composed of a layer of univariate neurons followed by a net of polynomial post-processing. We look at the general approximation properties of these networks observing in particular their relationship to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5a7d4450491b222a40c87fd9198abeb
https://doi.org/10.1080/095281300146317
https://doi.org/10.1080/095281300146317
Autor:
Richard F. Bonner, John A. Vaccaro
Publikováno v:
Physics Letters A. 198:167-174
We extend the Pegg-Barnett formalism, which describes the phase of a single-mode light field and is based on finite-dimensional Hilbert spaces, to the infinite-dimensional case. The infinite-dimensional versions of the Pegg-Barnett phase operators op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a309dc7983e680b24b2a3e8b5937c00f
https://doi.org/10.1016/0375-9601(95)00053-6
https://doi.org/10.1016/0375-9601(95)00053-6
Publikováno v:
Limnology and Oceanography. 38:1680-1695
Carbon standing stock distribution in the cuphotic zone of Lake Kinneret and the immediate fate of primary-produced carbon arc very different during late winter-early spring (with the occurrence of the annual dinollagellate bloom) than they are in la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1eddfb2bb01d639c600129eefa665044
https://doi.org/10.4319/lo.1993.38.8.1680
https://doi.org/10.4319/lo.1993.38.8.1680
Publikováno v:
SOFSEM 2001: Theory and Practice of Informatics ISBN: 9783540429128
SOFSEM
SOFSEM
The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bde5ae24fb87aeca1aeccebc6a54eacb
https://doi.org/10.1007/3-540-45627-9_15
https://doi.org/10.1007/3-540-45627-9_15
Autor:
Richard F. Bonner, Aija Berzina
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783540424871
FCT
FCT
An algorithm given by Ambainis and Freivalds [1] constructs a quantum finite automaton (QFA) with O(log p) states recognizing the language Lp = {ai| i is divisible by p} with probability 1 - Ɛ , for any Ɛ > 0 and arbitrary prime p. In [4] we gave e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ced4d283799780b0b500c271fad1495
https://doi.org/10.1007/3-540-44669-9_10
https://doi.org/10.1007/3-540-44669-9_10
Publikováno v:
SOFSEM’99: Theory and Practice of Informatics ISBN: 9783540666943
SOFSEM
SOFSEM
Quantum finite automata were introduced by C. Moore, J. P. Crutchfield [4], and by A. Kondacs and J. Watrous [3]. This notion is not a generalization of the deterministic finite automata. Moreover, in [3] it was proved that not all regular languages
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8e84c9e0b88b89ab2f43da48d34b5b0
https://doi.org/10.1007/3-540-47849-3_21
https://doi.org/10.1007/3-540-47849-3_21
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540662006
COCOON
COCOON
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::239d8d32a7fe4c040fb25de39d0955e4
https://doi.org/10.1007/3-540-48686-0_17
https://doi.org/10.1007/3-540-48686-0_17
Publikováno v:
Mathematical Foundations of Computer Science 1998 ISBN: 9783540648277
MFCS
MFCS
A language L (n) of n-tuples of words which is recognized by a n-tape rational finite-probabilistic automaton with probability 1-e, for arbitrary e > 0, is called quasideterministic. It is proved in [Fr 81], that each rational stochastic language is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27f03b4f47844da0b02fc15b97bd7226
https://doi.org/10.1007/bfb0055770
https://doi.org/10.1007/bfb0055770
Autor:
Tetyana I. Mamchych, Richard F. Bonner
Publikováno v:
Energy Procedia. :1870-1873
Numerical time series, but especially periodic such, are characterized up to pertinent symmetries by families of norms. The electricity consumption by a household, recorded daily during a month's time, say, may then be encoded in a sequence of number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8b1ea5107738c57b76a8979ad7aad67