Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 151 for “"Time complexity"”.
-
Optimization by Simulated Annealing: A Time-Complexity Analysis
… results are concerned with the average amount of time simulated annealing takes to find an acceptable solution.
-
Security systems based on Gaussian integers : Analysis of basic operations and time complexity of secret transformations
… based PK algorithms. In order to quantify the complexity of the Gaussian integer DLP, it is reduced to two other well known problems: DLP for Lucas sequences and the real integer DLP. Additionally, a novel exponentiation algorithm for Gaussian integers, called Lucas sequence Exponentiation of …
-
Three-dimensional visualization of multi-layered graphs with application to communications
… the algorithm does not excess two. The average time complexity of the Incremental Projection Algorithm is O( N N), where N is the number of vertices in a graph. If there is no degree of vertices great than M, the time complexity of the Incremental Projection Algorithm is O(N). The second …
-
Applying binary decision diagrams to learn hidden Markov models
… operate on Binary Decision Diagrams (BDDs). The time and memory complexity of the algorithm is contingent on the size of the BDD, highlighting that the BDD’s size significantly depends on the variable ordering (a problem known to be NP-complete). Preliminary experiments showed that the BDD size …
-
Near-Optimal Learning and Planning in Separated Latent MDPs
… there is a quasi-polynomial algorithm with time complexity scaling in terms of the statistical threshold. We further show a near-matching time complexity lower bound under the exponential time hypothesis.
-
Sorting Real Numbers into a Linked List on the PRAM Model
… linked list in terms of number of processors and time complexity. We have examined on how to sort the real numbers in the linked list using n^3, n^2 processors which has the time complexity of constant time and O(loglogn) time respectively. We have done good research in that area to come up with …
-
Comparison study of sorting techniques in dynamic data structure
… and widely studied issue, where the execution time and the required resources for computation is of extreme importance, especially if it is dealing with real-time data processing. Therefore, it is important to study and to compare in details all the available sorting algorithms. In this …
-
Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents
… assembly of exon predictions with O(n log n) time-complexity, (the standard algorithm for exon assembly has O(n²) time-complexity for ncRNA exon predictions,) and highly accurate statistical tests for exon boundaries based on recognition of non-contiguous patterns in known examples. It also …
-
Using K-means Clustering and Similarity Measure to Deal with Missing Rating in Collaborative Filtering Recommendation Systems
… to partition the entire dataset reduces the time complexity and improves the online scalability as well as the data density. Moreover, the similarity comparison method predicts and fills up the missing value in sparsity dataset to enhance the data density which boosts the recommendation …
-
Algorithms on Majority Problem
… algorithms for these problems and analyze their time complexity. For both versions we show O(n) time algorithms. These results could be compared with cases whose elements can be ordered. The paper has also been modified to give the solution to the majority problem where the number of occurrences …
-
Three essays on nonparametric estimation
… (2013), which can be found with a nearly linear time complexity in the number of points in the mesh (Altschuler et al., 2017). It is also a common thread that links all three essays. After providing results on consistency, limiting distribution, and rate of convergence for the estimator, the …
-
A new approach to feature extraction for RNA structure comparision
… for small RNA structures because of their high time complexity. In this thesis, we propose a simplified method to compare two RNA structures in O(mn) time, where m and n are the lengths of the two RNA sequences, respectively. The method transforms the RNA structures into specific sequences …
-
Symmetric rearrangeable networks and algorithms
… suffer low scalability and slow execution time. On the other hand, faster algorithms are blocking and thus limit throughput. This will be an acceptable trade-off for many applications where achieving ”wire speed” on the on-chip network would require extensive optimisation of the attached …
-
Imperfect gaps in Gap-ETH and PCPs
… to perfect in linear-sized PCPs for NTIME[0(n)] with a 0(log n) additive loss in the query complexity q. We show our result by constructing a "robust circuit" using threshold gates. These results are a gap amplification procedure for PCPs (when completeness is imperfect), analogous to …
-
Modelling on-domestic buildings energy performance using machine learning methods, a case study of the UK
… to achieve that goal. Due to the size and complexity of non-domestic buildings, finding optimum plans is cumbersome. To that end, artificial intelligence has been employed to assist this decision-making procedure, yet limited to high time-complexity of energy simulations. Surrogate …
-
Valid Time RDF
… decision making by machines. Naturally, time-varying data and knowledge are required in Semantic Web applications to incorporate time and further reason about it. However, the original specifications of Resource Description Framework (RDF) and Web Ontology Language (OWL) do not include …
-
On the complexity of synchronization
… towards a better understanding of the complexity of central tasks in standard distributed models. In the population protocols model, we demonstrate how to solve majority and leader election efficiently, in time 0(log² n), using 0(log n) states per node, for n nodes. Central to our …
-
Decomposing rectilinear regions into rectangles
… The partitioning problem can be solved in time O(n⁵ ²), where n is the number of vertices of the figure, whereas the covering problem is exponential in its time complexity.
-
Security of Unbalanced Oil-Vinegar Signature Scheme
… family of TTS systems. Then we have the related complexity analysis to claim that a family of TTS systems can be broken in the time complexity <i>O</i>(2<sup>61</sup>).</p><p>In the second half, we discuss the algebraic attack for the randomly built unbalancedoil-vinegar signature systems with …
-
Detecting Similar HTML Documents Using A Sentence-Based Copy Detection Approach
… similar documents performs reasonably well. The time complexity for our copy detection approach is O(n2), where, n is the total number of sentences in a HTML document, whereas the time complexity for detecting similar HTML documents using our copy detection approach is O(n log n). The overall …
Page 1 of 8