Добірка наукової літератури з теми "Depth data encoding algorithm"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Depth data encoding algorithm".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Depth data encoding algorithm"
Gois, Marcilyanne M., Paulo Matias, André B. Perina, Vanderlei Bonato, and Alexandre C. B. Delbem. "A Parallel Hardware Architecture based on Node-Depth Encoding to Solve Network Design Problems." International Journal of Natural Computing Research 4, no. 1 (January 2014): 54–75. http://dx.doi.org/10.4018/ijncr.2014010105.
Повний текст джерелаHe, Shuqian, Zhengjie Deng, and Chun Shi. "Fast Decision Algorithm of CU Size for HEVC Intra-Prediction Based on a Kernel Fuzzy SVM Classifier." Electronics 11, no. 17 (September 5, 2022): 2791. http://dx.doi.org/10.3390/electronics11172791.
Повний текст джерелаLilhore, Umesh Kumar, Osamah Ibrahim Khalaf, Sarita Simaiya, Carlos Andrés Tavera Romero, Ghaida Muttashar Abdulsahib, Poongodi M, and Dinesh Kumar. "A depth-controlled and energy-efficient routing protocol for underwater wireless sensor networks." International Journal of Distributed Sensor Networks 18, no. 9 (September 2022): 155013292211171. http://dx.doi.org/10.1177/15501329221117118.
Повний текст джерелаPetrova, Natalia, and Natalia Mokshina. "Using FIBexDB for In-Depth Analysis of Flax Lectin Gene Expression in Response to Fusarium oxysporum Infection." Plants 11, no. 2 (January 7, 2022): 163. http://dx.doi.org/10.3390/plants11020163.
Повний текст джерелаTăbuşand and Can Kaya. "Information Theoretic Modeling of High Precision Disparity Data for Lossy Compression and Object Segmentation." Entropy 21, no. 11 (November 13, 2019): 1113. http://dx.doi.org/10.3390/e21111113.
Повний текст джерелаJiang, Ming-xin, Xian-xian Luo, Tao Hai, Hai-yan Wang, Song Yang, and Ahmed N. Abdalla. "Visual Object Tracking in RGB-D Data via Genetic Feature Learning." Complexity 2019 (May 2, 2019): 1–8. http://dx.doi.org/10.1155/2019/4539410.
Повний текст джерелаHan, Lei, Xiaohua Huang, Zhan Shi, and Shengnan Zheng. "Depth Estimation from Light Field Geometry Using Convolutional Neural Networks." Sensors 21, no. 18 (September 10, 2021): 6061. http://dx.doi.org/10.3390/s21186061.
Повний текст джерелаYi, Luying, Xiangyu Guo, Liqun Sun, and Bo Hou. "Structural and Functional Sensing of Bio-Tissues Based on Compressive Sensing Spectral Domain Optical Coherence Tomography." Sensors 19, no. 19 (September 27, 2019): 4208. http://dx.doi.org/10.3390/s19194208.
Повний текст джерелаHuang, Zedong, Jinan Gu, Jing Li, Shuwei Li, and Junjie Hu. "Depth Estimation of Monocular PCB Image Based on Self-Supervised Convolution Network." Electronics 11, no. 12 (June 7, 2022): 1812. http://dx.doi.org/10.3390/electronics11121812.
Повний текст джерелаLim, Olivier, Stéphane Mancini, and Mauro Dalla Mura. "Feasibility of a Real-Time Embedded Hyperspectral Compressive Sensing Imaging System." Sensors 22, no. 24 (December 13, 2022): 9793. http://dx.doi.org/10.3390/s22249793.
Повний текст джерелаДисертації з теми "Depth data encoding algorithm"
Aldrovandi, Lorenzo. "Depth estimation algorithm for light field data." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018.
Знайти повний текст джерелаMansour, Moussa Reda. "Algoritmo para obtenção de planos de restabelecimento para sistemas de distribuição de grande porte." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-06052009-100440/.
Повний текст джерелаAn elaborated and fast energy restoration plan (ERP) is required to deal with steady faults in radial distribution systems (RDS). That is, after a faulted zone has been identified and isolated by the relays, it is desired to elaborate a proper ERP to restore energy on that zone. Moreover, during the normal system operation, it is frequently necessary to elaborate ERP to isolate zones to execute routine tasks of network maintenance. Some of the objectives of an ERP are: (i) very few interrupted customers (or none), and (ii) operating a minimal number of switches, while at the same time respecting security constraints. As a consequence, the service restoration is a multiple objective problem, with some degree of conflict. The main methods developed for elaboration of ERP are based on evolutionary algorithms (EA). The limitation of the majority of these methods is the necessity of network simplifications to work with large-scale RDS. In general, these simplifications restrict the achievement of an adequate ERP. This work proposes the development and implementation of an algorithm for elaboration of ERP, which can deal with large-scale RDS without requiring network simplifications, that is, considering a large number (or all) of lines, buses, loads and switches of the system. The proposed algorithm is based on a multi-objective EA, on a new graph tree encoding called node-depth encoding (NDE), as well as on two genetic operators developed to efficiently manipulate a graph trees stored in NDEs. Using a multi-objective EA, the proposed algorithm enables a better exploration of the search space. On the other hand, using NDE and its operators, the efficiency of the search is increased when the proposed algorithm is used generating proper ERP, because those operators generate only radial configurations where all consumers are attended. The efficiency of the proposed algorithm is shown using a Brazilian distribution system with 3,860 buses, 635 switches, 3 substations and 23 feeders.
Sengupta, Aritra. "Empirical Hierarchical Modeling and Predictive Inference for Big, Spatial, Discrete, and Continuous Data." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1350660056.
Повний текст джерелаOliveira, Marcos Antônio Almeida de. "Heurística aplicada ao problema árvore de Steiner Euclidiano com representação nó-profundidade-grau." Universidade Federal de Goiás, 2014. http://repositorio.bc.ufg.br/tede/handle/tede/4171.
Повний текст джерелаApproved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-02-19T14:34:20Z (GMT) No. of bitstreams: 2 Dissertação - Marcos Antônio Almeida de Oliveira - 2014..pdf: 1092566 bytes, checksum: 55edbdaf5b3ac84fe3f6835682fe2a13 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2015-02-19T14:34:20Z (GMT). No. of bitstreams: 2 Dissertação - Marcos Antônio Almeida de Oliveira - 2014..pdf: 1092566 bytes, checksum: 55edbdaf5b3ac84fe3f6835682fe2a13 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-09-03
Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG
A variation of the Beasley (1992) algorithm for the Euclidean Steiner tree problem is presented. This variation uses the Node-Depth-Degree Encoding, which requires an average time of O(n) in operations to generate and manipulate spanning forests. For spanning tree problems, this representation has linear time complexity when applied to network design problems with evolutionary algorithms. Computational results are given for test cases involving instances up to 500 vertices. These results demonstrate the use of the Node-Depth-Degree in an exact heuristic, and this suggests the possibility of using this representation in other techniques besides evolutionary algorithms. An empirical comparative and complexity analysis between the proposed algorithm and a conventional representation indicates the efficiency advantages of the solution found.
É apresentada uma variação do algoritmo de Beasley (1992) para o Problema árvore de Steiner Euclidiano. Essa variação utiliza a Representação Nó-Profundidade-Grau que requer, em média, tempo O(n) em operações para gerar e manipular florestas geradoras. Para problemas de árvore geradora essa representação possui complexidade de tempo linear sendo aplicada em problemas de projeto de redes com algoritmos evolutivos. Resultados computacionais são dados para casos de teste envolvendo instâncias de até 500 vértices. Esses resultados demonstram a utilização da representação Nó-Profundidade-Grau em uma heurística exata, e isso sugere a possibilidade de utilização dessa representação em outras técnicas além de algoritmos evolutivos. Um comparativo empírico e da análise de complexidade entre o algoritmo proposto e uma representação convencional indica vantagens na eficiência da solução encontrada.
Marques, Leandro Tolomeu. "Restabelecimento de energia em sistemas de distribuição considerando aspectos práticos." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-26072018-134924/.
Повний текст джерелаIn the context of distribution systems operation, service restoration is one of the problems with which operators constantly deal. It arises when a permanent fault occurs and is treated trough operations in switches at primary grid. Since distribution systems are usually radial, fault occurrence turns-off healthy customers. Thereby, the service restoration problem consists in defining, in a short processing time, the minimum amount of switches that must be operated for the isolation of the fault and reconnection of the maximum amount of healthy out-of-service customers. The efforts of developing computational tools for getting solution to this problems has increased in the last years. It is, in special, due to enormous losses caused to the utilities and to the whole society. In this sense, the main objective of this research is getting a method able to help the distribution system operator\'s work through providing service restoration plans quickly. The differentials of this research are its ability to: deal, in special, with large scale grids whit a reduced computational effort; consider costumers of several priority levels (note, for instance, a hospital has a higher supply priority in relation to a big supermarket) and prioritize the higher priority customers; provide a switching sequence able to isolate and reconnect the maximum amount of healthy out-of-service customer by the minimum amount of switching actions; select lower priority customers to keep out-of-service in order to reconnect higher priority customers when a it is not possible to restore all customers; and, additionally, prioritize switching operation in remotely controlled switches, whose operation is faster and cheapest than the operation of manually controlled switches. The proposed method mixes a local exhaustive search and a new multi-objective evolutionary algorithm in subpopulation tables that uses a data structure named Node-Depth Encoding. For evaluating the relative performance of proposed method, simulations were performed in small distribution systems and the performance was compared with the performance a Mathematical Programing method from literature. New experiments were performed a Mathematical Programing method from literature. New experiments were performed in several fault situations in the real and large-scale distribution system of Londrina-PR and adjacent cities. The solutions provided were appropriated to the treatment of such contingency situations. The same occurs with the switching sequences provided, which were able to prioritize the restoration of higher priority customers. Additional studies evaluated the variation of the running time with the size of grids and with the values adopted for the maximum number of generations of the evolutionary algorithm (which is an input parameter). The results expressed the running time of the proposed method is suitable to the problem needs. Therefore, it could be proved the proposed method achieved the specified objectives, in special, the treatment of practical aspects of the problem. Besides the proposed method, some contributions of this research are proposition of a new multi-objective evolutionary algorithm in subpopulation tables and a new reproduction operator to manipulate graph forests computationally represented by Node-Depth Encoding.
Hemanth, Kumar S. "On Applications of 3D-Warping and An Analysis of a RANSAC Heuristic." Thesis, 2018. http://etd.iisc.ac.in/handle/2005/4156.
Повний текст джерелаYu-ChihChang and 張宇志. "A Fast Depth Map Compression Algorithm for H.264 Encoding Scheme." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/21078118850434017531.
Повний текст джерела國立成功大學
電機工程學系碩博士班
100
Due to the rapid growth of population in consuming 3D or electronic products like smart phone and 3DTV, the issue of representation of 3D video is getting much more attention in recent years. There is one of the most famous 3D video representation called” Advanced Three-Dimensional Television System Technologies(ATTEST)”which uses a monoscopic video (color component) and per pixel depth information (depth component). After decoding the two sequences, it is used to synthesis free view-point views by means of depth image-based rendering techniques. Depth Image-based Rendering (DIBR) is a popular method to synthesis 3D free view-point virtual views. This method is based on a color sequence and its corresponding depth sequence to synthesize views of different positions. However, in transmission of real-time video, even if we have used the methods which we mentioned above to reduce the amount of data transferred instead of using the traditional direct encoding and decoding the two sequences, the environment of the wireless network and handheld devices on the power constraints, bandwidth is always limited. Therefore, data compression plays an important role in the 3D codec system. This thesis uses the H.264/AVC video encoding format and proposes a new algorithm for color video motion estimation and combines 3D search algorithm for depth map compression to decrease the overall encoding time and keep the depth map’s quality simultaneously.
Chen, Wei-Jen, and 陳威任. "The Modified Encoding Algorithm of ECG Data Compression Based on Wavelet Transform." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/04519476568133918606.
Повний текст джерела國立臺北科技大學
電機工程系碩士班
92
Because the ECG data are enormous and need long recording time, data compression of ECG has been investigated for several decades. The research purpose of this thesis is to improve the performance of data compression of ECG and obtain the high compressed rate and low reconstructed error. For data compression of ECG, the transform type encode structure is adopted in this thesis. Firstly, the input ECG signal is preprocessed into a relevant form. After preprocessing, the ECG signals are processed by the wavelet transform. According to the percent of energy between before and after compression, a threshold value can be examined. Using the value, the less significant data can be ignored. After threshold, run length encoding and DPCM are employed to encode the resulted data consequently. The total length of data includes the encoded data and the reference data used for reconstruction. Finally, in order to test and verify the effectiveness of the proposed algorithm, computer programs are developed to compress the ECG signals in MIT-BIH arrhythmia database. From the simulation results, it is seen that the higher compressed rate with less reconstructed error is obtained. In addition, the compressed rate and reconstructed error are adjustable according to the requirement.
Chen, Hung-lung, and 陳宏隆. "Run length encoding-- based algorithm for mining association rules in data stream." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/90489529147629035129.
Повний текст джерела南華大學
資訊管理學研究所
96
It is a new developing research field that the materials bunch flows and prospects, and the RLEated rule performs algorithms and is prospected by the materials (Data Mining) A quite important and practical technology in China. The RLEated type rule main purpose is to find out the dependence of some materials projects in the huge materials. The main method is to search the database and find out all high-frequency project teams; And utilize the high-frequency project team to excavate out all RLEated type rules.Because of the production of a large number of materials and a large number of candidate materials project teams, it is that one must consume a large number of work of calculating the cost to find out all high-frequency project teams. So, what effective materials amount while calculating of reduction, reduce the production of the project team of candidate materials, and reduce reading number of times,etc. of the database, the algorithm of performing that can make the RLEated type rule excavate is more efficient. Main content that we study utilizes and builds and constructs the regular code (Run-Length Encoding) The valid RLEated type rule of reduction in the dynamic database of the way performs the materials amount of algorithms while calculating, main contribution is the method of offering a kind of new materials to deal with, it utilized and traded the database and encoded a small amount of materials, then prospect the materials to the code materials mainly in the storing device directly, and can upgrade and encode the materials effectively in the unusual fluctuation of fast materials, perform the speed of execution of the algorithm with higher speed, improve and deal with efficiency.
Yu, Ang-Hsun, and 游昂勳. "An Improved Data Hiding Algorithm Based on the Method of Matrix Encoding." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/73459809838000223623.
Повний текст джерела國立暨南國際大學
資訊工程學系
100
The meaning of data (information) hiding is to embed the secret information into a cover host, such as an image. Usually, the naked eye of the people cannot perceive any change when the image is modified slightly. The evaluation of data hiding schemes should be measured by the distortion (or called Mean Square Error; MSE) and the embedding rate (the average number of bits embedded in a cover pixel). In this paper, we propose an improved data hiding scheme which improves the matrix encoding-based data hiding algorithm by the idea of Hamming+1 to further enhance the stego-image quality. This proposed improved scheme is verified to be correct through the theoretical analysis and the experiment.
Книги з теми "Depth data encoding algorithm"
Nakov, Svetlin. Fundamentals of Computer Programming with C#: The Bulgarian C# Book. Sofia, Bulgaria: Svetlin Nakov, 2013.
Знайти повний текст джерелаЧастини книг з теми "Depth data encoding algorithm"
Baidari, Ishwar, and Channamma Patil. "K-Data Depth Based Clustering Algorithm." In Computational Intelligence: Theories, Applications and Future Directions - Volume I, 13–24. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1132-1_2.
Повний текст джерелаSong, Bin, Limin Xiao, Guangjun Qin, Li Ruan, and Shida Qiu. "A Deduplication Algorithm Based on Data Similarity and Delta Encoding." In Communications in Computer and Information Science, 245–53. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-3969-0_28.
Повний текст джерелаMou, Xingang, Chang Liu, and Xiao Zhou. "Radar Echo Image Prediction Algorithm Based on Multi-scale Encoding-Decoding Network." In Intelligent Data Engineering and Automated Learning – IDEAL 2021, 637–46. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91608-4_61.
Повний текст джерелаDu, Jun, Emin Erkan Korkmaz, Reda Alhajj, and Ken Barker. "Alternative Clustering by Utilizing Multi-objective Genetic Algorithm with Linked-List Based Chromosome Encoding." In Machine Learning and Data Mining in Pattern Recognition, 346–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11510888_34.
Повний текст джерелаYe, Nan, Jianfeng Di, Jiapeng Zhang, Rui Zhang, Xiaopei Xu, and Ying Yan. "LDPC Encoding and Decoding Algorithm of LEO Satellite Communication Based on Big Data." In Lecture Notes in Electrical Engineering, 84–91. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-3387-5_10.
Повний текст джерелаWyss, Catharine, Chris Giannella, and Edward Robertson. "FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances Extended Abstract." In Data Warehousing and Knowledge Discovery, 101–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44801-2_11.
Повний текст джерелаGois, Marcilyanne Moreira, Danilo Sipoli Sanches, Jean Martins, João Bosco A. London Junior, and Alexandre Cláudio Botazzo Delbem. "Multi-Objective Evolutionary Algorithm with Node-Depth Encoding and Strength Pareto for Service Restoration in Large-Scale Distribution Systems." In Lecture Notes in Computer Science, 771–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37140-0_57.
Повний текст джерелаSingha, Souvik, and Debarshi Saha. "Encoding-Based Algorithm for Minimization of Inductive Cross-Talk Based on Off-Chip Data Transmission." In Lecture Notes in Electrical Engineering, 923–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21747-0_119.
Повний текст джерелаKathirvalavakumar, T., and R. Palaniappan. "Modified Run-Length Encoding Method and Distance Algorithm to Classify Run-Length Encoded Binary Data." In Communications in Computer and Information Science, 271–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19263-0_33.
Повний текст джерелаChen, J., D. Q. Chen, and S. H. Meng. "A Novel Region Selection Algorithm for Auto-focusing Method Based on Depth from Focus." In Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications, 101–8. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68527-4_11.
Повний текст джерелаТези доповідей конференцій з теми "Depth data encoding algorithm"
Zhou, Hao, Fen Chen, Zongju Peng, Gangyi Jiang, Mei Yu, and Wei Bi. "Encoding oriented depth video spatial processing algorithm." In 3rd International Conference on Green Communications and Networks. Southampton, UK: WIT Press, 2014. http://dx.doi.org/10.2495/gcn131142.
Повний текст джерелаWali, Ibtissem, Amina Kessentini, Mohamed Ali Ben Ayed, and Nouri Masmoudi. "Early depth partitioning determination algorithm for SHVC encoding standard." In 2017 18th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA). IEEE, 2017. http://dx.doi.org/10.1109/sta.2017.8314923.
Повний текст джерелаZongju Peng, Mei Yu, Gangyi Jiang, Yuehou Si, and Fen Chen. "Virtual view synthesis oriented fast depth video encoding algorithm." In 2010 2nd International Conference on Industrial and Information Systems (IIS 2010). IEEE, 2010. http://dx.doi.org/10.1109/indusis.2010.5565875.
Повний текст джерелаKum, Sang-Uok, and Ketan Mayer-Patel. "Reference Stream Selection for Multiple Depth Stream Encoding." In Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06). IEEE, 2006. http://dx.doi.org/10.1109/3dpvt.2006.117.
Повний текст джерелаGuo, Mingsong, Fen Chen, Chengkai Sheng, Zongju Peng, and Gangyi Jiang. "A depth video processing algorithm for high encoding and rendering performance." In SPIE/COS Photonics Asia, edited by Qionghai Dai and Tsutomu Shimura. SPIE, 2014. http://dx.doi.org/10.1117/12.2073478.
Повний текст джерелаSantos, Augusto Cesar dos, Alexandre C. B. Delbem, and Newton Geraldo Bretas. "A Multiobjective Evolutionary Algorithm with Node-Depth Encoding for Energy Restoration." In 2008 Fourth International Conference on Natural Computation. IEEE, 2008. http://dx.doi.org/10.1109/icnc.2008.843.
Повний текст джерелаHuang, D., and P. A. Versnel. "Depth estimation algorithm applied to FTG data." In SEG Technical Program Expanded Abstracts 2000. Society of Exploration Geophysicists, 2000. http://dx.doi.org/10.1190/1.1816076.
Повний текст джерелаAlTarawneh, Ragaad, Shah Rukh Humayoun, and Achim Ebert. "Utilization of variation in stereoscopic depth for encoding aspects of non-spatial data." In 2015 IEEE Symposium on 3D User Interfaces (3DUI). IEEE, 2015. http://dx.doi.org/10.1109/3dui.2015.7131741.
Повний текст джерелаKaewmanee, Jutanon, and Somporn Sirisumrannukul. "Multiobjective service restoration in distribution system using fuzzy decision algorithm and node-depth encoding." In 2011 8th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON 2011). IEEE, 2011. http://dx.doi.org/10.1109/ecticon.2011.5947984.
Повний текст джерелаSantos, Augusto, Alexandre Delbem, Joao Bosco London, and Newton Bretas. "Node-depth encoding and multiobjective evolutionary algorithm applied to large-scale distribution system reconfiguration." In 2011 IEEE Power & Energy Society General Meeting. IEEE, 2011. http://dx.doi.org/10.1109/pes.2011.6039211.
Повний текст джерелаЗвіти організацій з теми "Depth data encoding algorithm"
Chapman, Ray, Phu Luong, Sung-Chan Kim, and Earl Hayter. Development of three-dimensional wetting and drying algorithm for the Geophysical Scale Transport Multi-Block Hydrodynamic Sediment and Water Quality Transport Modeling System (GSMB). Engineer Research and Development Center (U.S.), July 2021. http://dx.doi.org/10.21079/11681/41085.
Повний текст джерелаO'Neill, Francis, Kristofer Lasko, and Elena Sava. Snow-covered region improvements to a support vector machine-based semi-automated land cover mapping decision support tool. Engineer Research and Development Center (U.S.), November 2022. http://dx.doi.org/10.21079/11681/45842.
Повний текст джерелаStriuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], November 2020. http://dx.doi.org/10.31812/123456789/4462.
Повний текст джерелаChamovitz, Daniel A., and Xing-Wang Deng. Developmental Regulation and Light Signal Transduction in Plants: The Fus5 Subunit of the Cop9 Signalosome. United States Department of Agriculture, September 2003. http://dx.doi.org/10.32747/2003.7586531.bard.
Повний текст джерела