Zobrazeno 1 - 10
of 227
pro vyhledávání: '"Grammar-based code"'
A newly developed grammar-based lossless source cod- ing theory and its implementation was proposed in 1999 and 2000, respectively, by Yang and Kieffer. The code first transforms the origi- nal data sequence into an irreducible context-free grammar,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99dc699e3587880be5de8797e00ac435
https://doi.org/10.32920/14638191.v1
https://doi.org/10.32920/14638191.v1
Publikováno v:
Chau, H H, McKay, A, Earl, C F, Behera, A K & de Pennington, A 2018, ' Exploiting lattice structures in shape grammar implementations ', Artificial Intelligence for Engineering Design, Analysis and Manufacturing, vol. 32, no. Special Issue 2, pp. 147-161 . https://doi.org/10.1017/S0890060417000282
The ability to work with ambiguity and compute new designs based on both defined and emergent shapes are unique advantages of shape grammars. Realizing these benefits in design practice requires the implementation of general purpose shape grammar int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7532de0b20cc011bbf1f0d42acd2e60d
https://doi.org/10.1017/s0890060417000282
https://doi.org/10.1017/s0890060417000282
Publikováno v:
Applied Soft Computing. 57:684-695
In some pattern recognition problems, the syntactic or structural information that describes each pattern is important. A syntactic pattern can be described using string grammar. There is only a handful of research works involving with the string gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fadc578d322fe2059797ca5b0f216bf4
https://doi.org/10.1016/j.asoc.2017.04.037
https://doi.org/10.1016/j.asoc.2017.04.037
Autor:
Newton Kiyotaka Miura, João José Neto
Compression techniques allow reduction in the data storage space required by applications dealing with large amount of data by increasing the information entropy of its representation. This paper presents an adaptive rule-driven device - the adaptive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ece83279bf5e45cb50530e125b7c46b0
Autor:
Artur Jeż
Publikováno v:
Theoretical Computer Science. 616:141-150
In this paper we present a really simple linear-time algorithm constructing a context-free grammar of size O(g log (N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a58a15ab0f4c34fbd09b563df91bb7d3
https://doi.org/10.1016/j.tcs.2015.12.032
https://doi.org/10.1016/j.tcs.2015.12.032
Publikováno v:
Applied Soft Computing. 38:453-468
A background on theory of grammar induction is presented.The effect of premature convergence is discussed in detail.Proposed a system for grammar inference by utilizing the mask-fill reproduction operators and Boolean based procedure with minimum des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::909b922ea81a75e73b161b70102f34d2
https://doi.org/10.1016/j.asoc.2015.09.044
https://doi.org/10.1016/j.asoc.2015.09.044
Autor:
Artur Jeż
Publikováno v:
Theoretical Computer Science. 592:115-134
In this paper we present a simple linear-time algorithm constructing a context-free grammar of size O(g log(N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d384dc53ec2e0a950329a778b820fad
https://doi.org/10.1016/j.tcs.2015.05.027
https://doi.org/10.1016/j.tcs.2015.05.027
Publikováno v:
Language Resources and Evaluation. 49:51-75
The development of precision grammars is an inherently resource-intensive process; their complexity means that changes made to one area of a grammar often introduce unexpected flow-on effects elsewhere in the grammar which may only be discovered afte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::312b10ac98068607e8a8ccb7ea9579c8
https://doi.org/10.1007/s10579-014-9293-0
https://doi.org/10.1007/s10579-014-9293-0
Autor:
Ján Kollár, Michal Sicak
Publikováno v:
FedCSIS
We present an improved version of algorithm that can transform any context-free grammar into a supercombinator form. Such a form is composed only of lambda calculus' supercombinators that are enriched by grammar operations. The main properties of thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40f02ea61b26b150528827535dd6bda9
https://doi.org/10.15439/2017f249
https://doi.org/10.15439/2017f249
Autor:
Zdenek Kotasek, Ondrej Cekan
Publikováno v:
DSD
The aim of this paper is to show the use of a probabilistic context-free grammar in the domain of stimulus generation, especially random test program generation for processors. Nowadays, the randomly constructed test stimuli are largely applied in fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25bc031ec32d8847e112af454eccafe0
https://doi.org/10.1109/dsd.2017.26
https://doi.org/10.1109/dsd.2017.26