Zobrazeno 1 - 10
of 190
pro vyhledávání: '"Thomas R. Fischer"'
Autor:
Thomas R. Fischer
Publikováno v:
Informes de la Construccion, Vol 48, Iss 443, Pp 51-51 (1996)
Externí odkaz:
https://doaj.org/article/f0d09d34d0fb4d9396af1334da233bca
Publikováno v:
Information and Computation. 256:45-61
We show that the information rate of the language accepted by a reversal-bounded deterministic counter machine is computable. For the nondeterministic case, we provide computable upper bounds. For the class of languages accepted by multi-tape determi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d48951602a3ecf3e78eb7d3cb5972706
https://doi.org/10.1016/j.ic.2017.04.008
https://doi.org/10.1016/j.ic.2017.04.008
Publikováno v:
Computability. 6:165-181
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0d2d7b1abc1710448883d97a0ff8110
https://doi.org/10.3233/com-150050
https://doi.org/10.3233/com-150050
Publikováno v:
GLOBECOM
To properly determine the severity of an emergency and provide a quick response, information has to be gathered, confirmed, and analyzed. Artificial intelligence assisted UAV can provide a unique perspective and review extensive information for an in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31b706c8ddf483d78e8cc220da1a20f8
https://doi.org/10.1109/glocom.2018.8648094
https://doi.org/10.1109/glocom.2018.8648094
Publikováno v:
Theoretical Computer Science. 654:33-44
A mutual information rate is proposed to quantitatively evaluate inter-process synchronized communication. For finite-state processes with implicit communication that can be described by a counting language, it is shown that the mutual information ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6513d917bfcd0ddae7b4d3508b17ba7c
https://doi.org/10.1016/j.tcs.2016.01.042
https://doi.org/10.1016/j.tcs.2016.01.042
Publikováno v:
IEEE Transactions on Signal Processing. 64:4444-4454
State estimation is studied for a special class of flag Hidden Markov Models (HMMs), which comprise 1) an arbitrary finite-state underlying Markov chain and 2) a structured observation process wherein a subset of states emit distinct flags with some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96bb88fe76b3cf850ae122517adc0444
https://doi.org/10.1109/tsp.2016.2568167
https://doi.org/10.1109/tsp.2016.2568167
Publikováno v:
Information and Computation. 246:20-29
We study the Shannon information rate of accepting runs of various forms of automata. This rate is a complexity indicator for executions of these automata. Accepting runs of finite automata and reversal-bounded nondeterministic counter machines, as w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53b676a3c07c861c422a18a4c9a98484
https://doi.org/10.1016/j.ic.2015.11.006
https://doi.org/10.1016/j.ic.2015.11.006
Publikováno v:
CISS
A cyclic prefix orthogonal frequency division multiplexing (CP-OFDM) system that transmits information over a time-varying fading channel is considered. In channels with large Doppler spreads, the frequency orthogonality assumption of OFDM is not val
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcf81d2ed5920efa72129e030b406e9b
https://doi.org/10.1109/ciss.2017.7926130
https://doi.org/10.1109/ciss.2017.7926130
Publikováno v:
International Journal of Foundations of Computer Science. 25:195-217
We derive a quantitative relationship between the maximal entropy rate achieved by a blackbox software system's specification graph, and the probability of faults Pnobtained by testing the system, as a function of the length n of a test sequence. By
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5a9fbbd6f02880d5eb159c958d7caa2
https://doi.org/10.1142/s0129054114500105
https://doi.org/10.1142/s0129054114500105
Publikováno v:
Theoretical Computer Science. 498:58-75
We use an information-theoretic notion, namely, (Shannon) information rate, to generalize common syntactic similarity metrics (like Hamming distance and longest common subsequences) between strings to ones between languages. We show that the similari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f9593dc71ee5c88e12009299d020ab5
https://doi.org/10.1016/j.tcs.2013.05.040
https://doi.org/10.1016/j.tcs.2013.05.040