Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Trigraph"'
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.
Autor:
Nelson Mbulaheni Musehane
Publikováno v:
South African Journal of African Languages; Vol 39, No 3 (2019); 223-227
In Tshivenḓa, there are clear discrepancies between the written and spoken forms of words. This affects the writing and compilation of dictionaries because sometimes a trigraph such as tsh has two distinct pronunciations, namely [tʃh] and [tʃ’]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e55d9ff7f64f02c2e37f9f13dc39f92d
https://doi.org/10.1080/02572117.2019.1618018
https://doi.org/10.1080/02572117.2019.1618018
Publikováno v:
IEEE Access, Vol 7, Pp 161805-161821 (2019)
Due to the explosive growth of image data, image annotation has been one of the most popular research directions in computer vision. It has been widely used in image retrieval, image analysis and understanding. Because traditional manual image annota
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04b541d9f3f000a520e0ba0f8093d8e7
https://ieeexplore.ieee.org/document/8888274/
https://ieeexplore.ieee.org/document/8888274/
Publikováno v:
Algorithmica. 80:3618-3645
We consider the graph sandwich problem and introduce almost monotone properties, for which the sandwich problem can be reduced to the recognition problem. We show that the property of containing a graph in $${\mathcal {C}}$$ as an induced subgraph is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aed7905f3c284f37ce1e606e9d0d2f96
https://doi.org/10.1007/s00453-018-0409-6
https://doi.org/10.1007/s00453-018-0409-6
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.
Autor:
Irene Paniello
Publikováno v:
Linear and Multilinear Algebra. 65:943-961
We attach two weighted digraphs to any coalgebra C with genetic realization. Algebraically, these digraphs describe the right and left coideal structure of C, whereas genetically they represent the backwards inheritance through the male and female he
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52cfbd1aff8175b4049f1e8490206cc3
https://doi.org/10.1080/03081087.2016.1217824
https://doi.org/10.1080/03081087.2016.1217824
Autor:
M. Geetha, Devika Raj
Publikováno v:
2018 International Conference on Communication and Signal Processing (ICCSP).
As the electronic documents are increasing due to the revolution of information there is an urgent need for summarizing the text documents. From the previous works we observed that there is no generalized graph model for text summarization and low or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5eb1e64a804178437902fece6d69b189
https://doi.org/10.1109/iccsp.2018.8524528
https://doi.org/10.1109/iccsp.2018.8524528
Autor:
Guilherme D. da Fonseca, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
Publikováno v:
Discrete Applied Mathematics. 197:3-19
We introduce a method to decide whether a graph G admits a realization on the plane in which two vertices lie within unitary distance from one another exactly if they are neighbors in G . Such graphs are called unit disk graphs, and their recognition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5baf5d0a927700aa1564b52a0c34ac7
https://doi.org/10.1016/j.dam.2014.08.014
https://doi.org/10.1016/j.dam.2014.08.014
Autor:
Shambhu Upadhyaya, Hayreddin Ceker
Publikováno v:
WIFS
Biometrics has become ubiquitous and spurred common use in many authentication mechanisms. Keystroke dynamics is a form of behavioral biometrics that can be used for user authentication while actively working at a terminal. The proposed mechanisms in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17796d87bb17fdfdd98a6019a92d9a61
https://doi.org/10.1109/wifs.2017.8267667
https://doi.org/10.1109/wifs.2017.8267667
Publikováno v:
2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT).
Play Fairal gorithm has been enhanced in various ways. One of the methods is to increase the confusion rates by transforming the algorithm into 3D-playfair which has four tables of 4×4 and accepts trigraph rather than digraph. This paper further enh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::451f2ee8a7bc189ad5e9a0f6783573b5
https://doi.org/10.1109/crcsit.2017.7965538
https://doi.org/10.1109/crcsit.2017.7965538