Search Results - BIG O NOTATION
-
1
Stealing Some Notation from Big O Notation to Develop a New Multithreading Priority Formula
Published in ITEGAM-JETIA (2025-02-01)Get full text
Article -
2
The Big-O Problem
Published in Logical Methods in Computer Science (2022-03-01)“…The problem is related to $\varepsilon$-differential privacy, for which the optimal constant of the big-O notation is exactly $\exp(\varepsilon)$.…”
Get full text
Article -
3
Simulation Expirment for Proofing the Theoretical Assumption of Time Complexity for Binary Search Tree
Published in Ibn Al-Haitham Journal for Pure and Applied Sciences (2017-04-01)Subjects: “…Time Complexity, Binary Search Tree, Big O Notation, Recursive Method, Chi square.…”
Get full text
Article -
4
The comparison of the effectiveness of the lowest supply lowest cost (LSLC) algorithm and the exponential approach algorithm in transportation problems
Published in Desimal (2021-07-01)“…Both methods are made in a MATLAB program, generating a script that calculates the algorithm's time complexity. Using the function notation, the Big-O Algorithm complexity of the Lowest Supply Lowest Cost method is more efficient than the Exponential Approach Method algorithm. …”
Get full text
Article -
5
Development Binary Search Algorithm
Published in مجلة بغداد للعلوم (2011-06-01)Get full text
Article -
6
SGMiner: A Fast and Scalable GPU-Based Frequent Pattern Miner on SSDs
Published in IEEE Access (2022-01-01)Get full text
Article -
7
Tunable 24-GHz Antenna Arrays Based on Nanocrystalline Graphite
Published in IEEE Access (2021-01-01)Get full text
Article -
8
A Novel Convolution-Based Algorithm for the Acyclic Network Symbolic Reliability Function Problem
Published in IEEE Access (2020-01-01)Get full text
Article -
9
-
10
TrickleKV: A High-Performance Key-Value Store on Disaggregated Storage With Low Network Traffic
Published in IEEE Access (2024-01-01)Get full text
Article -
11
XPath Node Selection over Grammar-Compressed Trees
Published in Electronic Proceedings in Theoretical Computer Science (2013-11-01)“…Here we present precise bounds on the time complexity of this problem, in terms of big-O notation. For a given grammar and XPath query, we consider three different tasks: (1) to count the number of nodes selected by the query, (2) to materialize the pre-order numbers of the selected nodes, and (3) to serialize the subtrees at the selected nodes.…”
Get full text
Article -
12
Efficient Quantum Protocol for Private Set Intersection Cardinality
Published in IEEE Access (2018-01-01)“…Compared to classical solutions, the proposed quantum PSI-CA protocol achieves an exponential reduction in communication complexity, since it only needs <inline-formula> <tex-math notation="LaTeX">$O(1)$ </tex-math></inline-formula> communication cost. …”
Get full text
Article -
13
Automated process for analyzing 2D CAD floor plan drawings and generating FloorspaceJS-compatible space objects for building energy simulations
Published in Results in Engineering (2025-06-01)“…The results indicate that the time complexity of this process, represented using Big O notation to describe the upper bound of algorithmic runtime in computational complexity analysis, is O(NM), where N represents the total number of vertices and M represents the total number of line segments in the relevant layer of the drawing. …”
Get full text
Article -
14
Application of Three-Dimensional Hierarchical Density-Based Spatial Clustering of Applications with Noise in Ship Automatic Identification System Trajectory-Cluster Analysis
Published in Applied Sciences (2025-02-01)“…This study also utilized O notation and execution time to represent the performance of various methods, with the literature review indicating that HDBSCAN has the same time complexity as DBSCAN but outperforms K-means and other methods. …”
Get full text
Article -
15
Machine Learning Framework for Hybrid Clad Characteristics Modeling in Metal Additive Manufacturing
Published in Journal of Manufacturing and Materials Processing (2025-02-01)“…We comprehensively benchmark ML models across traditional, ensemble, and neural network categories, analyzing their computational complexity through Big O notation and evaluating both classification and regression performance in predicting clad geometries and process maps. …”
Get full text
Article -
16
Wearable Electromyography Classification of Epileptic Seizures: A Feasibility Study
Published in Bioengineering (2023-06-01)“…Redundant features were examined with the Big-O notation method and with the average execution time method to select the feature that leads to lower complexity and reduced processing time. …”
Get full text
Article -
17
SCP-Tree: Finding Multiple Nearest Parking Spots With Minimal Group Travel Cost
Published in IEEE Access (2021-01-01)Get full text
Article -
18
Improved Fingerprint-Based Localization Based on Sequential Hybridization of Clustering Algorithms
Published in Emerging Science Journal (2024-04-01)“…The performance metrics considered for the comparisons are the position root mean square error (RMSE) and clustering time based on big O notation. The simulation results show that the proposed sequential hybrid clustering algorithm has improved localization accuracy with position RMSEs of about 54%, 77%, and 52%, respectively, higher than those of the m-APC, FCM, and 2-CAP algorithms. …”
Get full text
Article -
19
Studi Komparasi Kinerja Object-Relational Mapping Berdasarkan Implementasi Data Source Architectural Pattern
Published in Jurnal Nasional Teknik Elektro dan Teknologi Informasi (2025-05-01)“…Analisis dilakukan dengan KCachegrind dan Big-O notation. Analisis menghasilkan grafik kinerja dan relative percentage difference serta kontribusi fungsi-fungsi terhadap kinerja. …”
Get full text
Article
