Results 41 to 50 of about 22,397,908 (376)
A novel and efficient approach for line segment clipping against a convex polygon
Ruhuna Journal of Science, 2019 This paper proposes a new line clipping algorithm against a convex polygon with 𝑂(𝑁) time complexity. The line segment is pruned against each extended edge of the polygon as the first step of the proposed algorithm.
K. R. Wijeweera +2 more
doaj +1 more source
Verifying Time Complexity of Deterministic Turing Machines [PDF]
, 2014 We show that, for all reasonable functions $T(n)=o(n\log n)$, we can algorithmically verify whether a given one-tape Turing machine runs in time at most $T(n)$. This is a tight bound on the order of growth for the function $T$ because we prove that, for $
Gajser, David
core +1 more source
Quantum chaos and the complexity of spread of states [PDF]
Physical Review D, 2022 We propose a measure of quantum state complexity defined by minimizing the spread of the wave-function over all choices of basis. Our measure is controlled by the"survival amplitude"for a state to remain unchanged, and can be efficiently computed in ...
V. Balasubramanian +3 more
semanticscholar +1 more source
Shape matching and object recognition using common base triangle area
IET Computer Vision, 2015 Shape matching has always been a key issue in the field of computer vision. To obtain high recognition accuracy with low time complexity and to reduce the influence of contour deformation due to noise in shape matching, a novel shape matching method ...
Dameng Hu +4 more
doaj +1 more source
Efficient Algorithms for Subgraph Listing
Algorithms, 2014 Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
doaj +1 more source
Edge decompositions of multigraphs into multi-2-paths [PDF]
Opuscula Mathematica, 2004 We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges.
Jan Kratochvil +3 more
doaj
Quantifying the Dynamical Complexity of Chaotic Time Series [PDF]
, 2016 Acknowledgements The author wishes to acknowledge G. Giacomelli, M. Mulansky, and L.
Politi, Antonio
core +2 more sources
On quasilinear-time complexity theory
Theoretical Computer Science, 1994 AbstractThis paper furthers the study of quasilinear-time complexity initiated by Schnorr and Gurevich and Shelah. We show that the fundamental properties of the polynomial-time hierarchy carry over to the quasilinear-time hierarchy. Whereas all previously known versions of the Valiant-Vazirani reduction from NP to parity run in quadratic time, we give
Kenneth W. Regan +2 more
openaire +2 more sources
Sensors, 2018 Clustering is the most common method for organizing unlabeled data into its natural groups (called clusters), based on similarity (in some sense or another) among data objects.
Hassan Mushtaq +6 more
doaj +1 more source
Improved Time Complexities for Learning Boolean Networks
Entropy, 2013 Existing algorithms for learning Boolean networks (BNs) have time complexities of at least O(N · n0:7(k+1)), where n is the number of variables, N is the number of samples and k is the number of inputs in Boolean functions.
Chee Keong Kwoh, Yun Zheng
doaj +1 more source