Zobrazeno 1 - 10
of 393
pro vyhledávání: '"Stochastic grammar"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE transactions on aerospace and electronic systems 57 (2021): 1996–2005. doi:10.1109/TAES.2021.3083419
info:cnr-pdr/source/autori:Carravetta F.; White L.B./titolo:Embedded stochastic syntactic processes: A class of stochastic grammars equivalent by embedding to a Markov process/doi:10.1109%2FTAES.2021.3083419/rivista:IEEE transactions on aerospace and electronic systems/anno:2021/pagina_da:1996/pagina_a:2005/intervallo_pagine:1996–2005/volume:57
info:cnr-pdr/source/autori:Carravetta F.; White L.B./titolo:Embedded stochastic syntactic processes: A class of stochastic grammars equivalent by embedding to a Markov process/doi:10.1109%2FTAES.2021.3083419/rivista:IEEE transactions on aerospace and electronic systems/anno:2021/pagina_da:1996/pagina_a:2005/intervallo_pagine:1996–2005/volume:57
This article addresses the problem of suitably defining statistical models of languages derived from context-free grammars (CFGs), where the observed strings may be corrupted by noise or other mechanisms. This article uses the concept of a stochastic
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Volume: 16, Issue: 2 121-129
Electronic Letters on Science and Engineering
Electronic Letters on Science and Engineering
Data hiding has been a very interesting issue recently and various methods have been developed to deal with this issue. With the development of data hiding techniques, suitable steganalysis design to detect hidden data appears in studies. However, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=tubitakulakb::2b10c4b7220d125519ed47ec075cb54c
https://dergipark.org.tr/tr/pub/else/issue/58236/836293
https://dergipark.org.tr/tr/pub/else/issue/58236/836293
Autor:
Alvin Fazrie
Publikováno v:
JURNAL TEKNIK INFORMATIKA. 11:75-84
The paper gives an overview about the process between two language processing methods towards Human-robot interaction. In this paper, Echo State Networks and Stochastic-learning grammar are explored in order to get an idea about generating human’s
Publikováno v:
Information and computation
281 (2021): 1–28. doi:10.1016/j.ic.2020.104667
info:cnr-pdr/source/autori:Carravetta F.; White L.B./titolo:Syntactic stochastic processes: Definitions, models, and related inference problems/doi:10.1016%2Fj.ic.2020.104667/rivista:Information and computation (Print)/anno:2021/pagina_da:1/pagina_a:28/intervallo_pagine:1–28/volume:281
281 (2021): 1–28. doi:10.1016/j.ic.2020.104667
info:cnr-pdr/source/autori:Carravetta F.; White L.B./titolo:Syntactic stochastic processes: Definitions, models, and related inference problems/doi:10.1016%2Fj.ic.2020.104667/rivista:Information and computation (Print)/anno:2021/pagina_da:1/pagina_a:28/intervallo_pagine:1–28/volume:281
We define a Syntactic Stochastic Process (SSP) as a stochastic process valued in the set of terminal symbols of a grammar, and whose realizations are terminal strings generated by some stochastic grammar. and show that any SSP generated by a Stochast
Publikováno v:
IEEE Transactions on Fuzzy Systems. 25:1391-1402
The classification problem in the real-world applications always involves uncertainties in both stochastic and fuzzy nature. This paper proposes a classification framework based on the unified probabilistic fuzzy configuration for data with uncertain
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Stephanie S. Shih
Publikováno v:
Phonology. 34:243-268
This paper examines a key difference between constraint conjunction and constraint weight additivity, arguing that the two do not have the same empirical coverage. In particular, constraint conjunction in weighted probabilistic grammar allows for sup