Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Convex hull algorithms"'
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ceylon Journal of Science, Vol 50, Iss 3, Pp 261-268 (2021)
The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n). It has been proved that the lower bound of time
Externí odkaz:
https://doaj.org/article/f8fff47d164241e999c9085ab6fb1003
Autor:
Inoussa Laouali, Isaías Gomes, Maria da Graça Ruano, Saad Dosse Bennani, Hakim El Fadili, Antonio Ruano
Publikováno v:
Energies, Vol 15, Iss 23, p 9073 (2022)
Energy-saving schemes are nowadays a major worldwide concern. As the building sector is a major energy consumer, and hence greenhouse gas emitter, research in home energy management systems (HEMS) has increased substantially during the last years. On
Externí odkaz:
https://doaj.org/article/d10688104fc4453ca12b9a9d384dd1b6
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:
Tomasz Sadowski, Rafal Zdunek
Publikováno v:
Neurocomputing. 331:150-164
Many computational problems in machine learning can be represented with near-separable matrix factorization models. In a geometric approach, linear separability means that the entire set of data points can be modeled as a conical combination of a few
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a582ebc1ec786883a5a9c82d3e4df73
https://doi.org/10.1016/j.neucom.2018.11.026
https://doi.org/10.1016/j.neucom.2018.11.026
Autor:
S. R. Kodituwakku, K. R. Wijeweera
Publikováno v:
Ceylon Journal of Science, Vol 50, Iss 3, Pp 261-268 (2021)
The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n). It has been proved that the lower bound of time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20d2f92fe08c760cf9cb149a2a8b90e9
https://doi.org/10.4038/cjs.v50i3.7907
https://doi.org/10.4038/cjs.v50i3.7907
Autor:
Alberto Beltran, Sonia Mendoza
Publikováno v:
IEEE Latin America Transactions. 16:2289-2295
Thanks to the advances in hardware (sensors and cameras) the number of points that convex hull algorithms must process is now much greater than when these algorithms were developed. This limitation entails focusing current research in convex hull alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cac8477796ca43371db5e6161f2a0fb
https://doi.org/10.1109/tla.2018.8528248
https://doi.org/10.1109/tla.2018.8528248
Publikováno v:
The International Journal of Advanced Manufacturing Technology. 96:3109-3126
The existing method to determine the parting direction for core and cavity of two-plate mold is usually limited to decided types of direction. This limitation reduces the capability of the existing method to select the best parting direction for a 3D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edb82e8e89759288a9e804b44335fb63
https://doi.org/10.1007/s00170-018-1695-5
https://doi.org/10.1007/s00170-018-1695-5
Publikováno v:
Computers & Industrial Engineering. 159:107474
Non-radial data envelopment analysis (DEA) models, such as the slacks-based measure (SBM) model, exert an important role in theoretical research and real applications on efficiency evaluation and improvement. However, those models maximize input and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94bef993f5d2a7fe2f25300db8143843
https://doi.org/10.1016/j.cie.2021.107474
https://doi.org/10.1016/j.cie.2021.107474
Publikováno v:
International Journal of Remote Sensing. 38:1083-1100
Forest inventory parameters such as crown projection area and crown volume are critical to the study of single-tree biomass and 3D green biomass. The objective of this study is to develop highly precise measurement and calculation methods for crown p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::332c821ce059a1c776b3fc078d3530ed
https://doi.org/10.1080/01431161.2016.1265690
https://doi.org/10.1080/01431161.2016.1265690
Autor:
Jyrki Katajainen, Ask Neve Gamby
Publikováno v:
Algorithms, Vol 11, Iss 12, p 195 (2018)
Gamby, A N & Katajainen, J 2018, ' Convex-hull algorithms : Implementation, testing, and experimentation ', Algorithms, vol. 11, no. 12, 195 . https://doi.org/10.3390/a11120195
Gamby, A N & Katajainen, J 2018, ' Convex-hull algorithms : Implementation, testing, and experimentation ', Algorithms, vol. 11, no. 12, 195, pp. 1-27 . https://doi.org/10.3390/a11120195
Algorithms
Volume 11
Issue 12
Gamby, A N & Katajainen, J 2018, ' Convex-hull algorithms : Implementation, testing, and experimentation ', Algorithms, vol. 11, no. 12, 195 . https://doi.org/10.3390/a11120195
Gamby, A N & Katajainen, J 2018, ' Convex-hull algorithms : Implementation, testing, and experimentation ', Algorithms, vol. 11, no. 12, 195, pp. 1-27 . https://doi.org/10.3390/a11120195
Algorithms
Volume 11
Issue 12
From a broad perspective, we study issues related to implementation, testing, and experimentation in the context of geometric algorithms. Our focus is on the effect of quality of implementation on experimental results. More concisely, we study algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c7b97e2ded0af47310291b7171190dc
https://www.mdpi.com/1999-4893/11/12/195
https://www.mdpi.com/1999-4893/11/12/195