Zobrazeno 1 - 10
of 159
pro vyhledávání: '"z-order"'
Autor:
Yang Ma, Xujun Zhao
Publikováno v:
IEEE Access, Vol 9, Pp 81765-81777 (2021)
Outlier detection algorithms based on ${k}$ nearest neighbors ( ${k}$ NN) can effectively find outliers from massive data, but most algorithms are difficult to adapt to high-dimensional data sets. In order to highlight the importance of attributes in
Externí odkaz:
https://doaj.org/article/c1122c85081e46c1840e40e859e1a177
Autor:
Ali Hussain, Rehab Hassan
Publikováno v:
Engineering and Technology Journal, Vol 38, Iss 1B, Pp 15-25 (2020)
Spatial indexes, such as those based on the Quad Tree, are important in spatial databases for the effective implementation of queries with spatial constraints, especially when queries involve spatial links. The quaternary trees are a very interesting
Externí odkaz:
https://doaj.org/article/99512773a1ac405fb5f755ddf2ae7bfd
Publikováno v:
Image Analysis and Stereology, Vol 38, Iss 3, Pp 227-235 (2019)
This paper introduces improvements to the algorithm that was proposed in 2001 by Chen and Chen. The algorithm constructs a quadtree directly from Freeman chain code in four directions. We have improved the algorithm in two ways: Firstly, a time effic
Externí odkaz:
https://doaj.org/article/c4c2aa2c29bf4a46b17d1a18e3ba99dc
Publikováno v:
IEEE Access, Vol 6, Pp 1350-1361 (2018)
The Hausdorff distance (HD) between two point sets is widely used in similarity measures, but the high computational cost of HD algorithms restrict their practical use. In this paper, we analyze the time complexity to compute an accurate Hausdorff di
Externí odkaz:
https://doaj.org/article/d95c6d763959406ea5132fd7ee3fae03
Publikováno v:
Dianxin kexue, Vol 31, Pp 52-62 (2015)
A new variant of k nearest neighbor queries，which called as all k-nearest neighbor queries（AkNN），is a process to search the k nearest neighbors of each object in a data set.An AkNN query algorithm for high-dimensional big data on the Hadoop s
Externí odkaz:
https://doaj.org/article/f6b86f58eeab4722ba6f30f11bfc31ae
Autor:
Grgur, Filip
Ovaj rad opisuje postupke pretvaranja slike u nizove različitim algoritmima. Isti su zatim komprimirani korištenjem nekih od alata za kompresiju te su uspoređeni dobiveni rezultati. Objašnjeni su algoritmi Hilbertove krivulje, Z krivulje, pretvar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::96cd0931601aa00f6853cadaa596ebd4
https://urn.nsk.hr/urn:nbn:hr:190:647422
https://urn.nsk.hr/urn:nbn:hr:190:647422
Publikováno v:
IEEE Transactions on Big Data. 7:241-254
Modern microprocessors offer a rich memory hierarchy including various levels of cache and registers. Some of these memories (like main memory, L3 cache) are big but slow and shared among all cores. Others (registers, L1 cache) are fast and exclusive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::319b2961c009e717216a632c7024edea
https://doi.org/10.1109/tbdata.2018.2830378
https://doi.org/10.1109/tbdata.2018.2830378
Publikováno v:
International journal of electrical and computer engineering systems
Volume 12
Issue 1
Volume 12
Issue 1
Over the past few years, Deep learning (DL) has revolutionized the field of data analysis. Not only are the algorithmic paradigms changed, but also the performance in various classification and prediction tasks has been significantly improved with re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::580c572695eba7db5056797211fb4bbd
https://doi.org/10.32985/ijeces.12.1.3
https://doi.org/10.32985/ijeces.12.1.3
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:
Image Analysis and Stereology, Vol 38, Iss 3, Pp 227-235 (2019)
This paper introduces improvements to the algorithm that was proposed in 2001 by Chen and Chen. The algorithm constructs a quadtree directly from Freeman chain code in four directions. We have improved the algorithm in two ways: Firstly, a time effic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::619d0d8f481a69dc6396f88fc6bc6211
https://doi.org/10.5566/ias.2095
https://doi.org/10.5566/ias.2095