Results 81 to 90 of about 4,693,176 (171)
Reconstruction of Optical Coherence Tomography Images from Wavelength Space Using Deep Learning
SensorsConventional Fourier domain Optical Coherence Tomography (FD-OCT) systems depend on resampling into a wavenumber (k) domain to extract the depth profile.
Maryam Viqar +3 more
doaj +1 more source
Average case analysis of marking algorithms [PDF]
, 1984 The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n^2) in all cases, but it has been assumed that the average case time complexity O(n lg n). It is proven that the average case time complexity is H(n^2).
Hirschberg, D. S., Larmore, L. L.
core +1 more source
Time complexity analysis of generalized decomposition algorithm [PDF]
, 1997 The time complexity of the fast algorithm for generalized disjunctive decomposition of an rvalued function is studied.The considered algorithm to find the best decomposition is based on the analysis of multiple-terminal multiple-valued decision diagrams.
Kalganova, T, Pshibytko, V
core
, 2020 The following remarks are intended as philosophical comments on Gilles Deleuze’s groundbreaking reflections on a control society emerging at the end of the 20th century (cf. Deleuze 1992). Following Foucault, Deleuze’s interpretations of the ‘contemporary’ socio-technological transformations are mostly of a spatio-technical nature; the aim of this ...
Avanessian, Armen, Hennig, Anke
openaire +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
On the measurements of algorithms in big data era
大数据, 2016 The ability to store and analyze big data is a crucial capability of a powerful country in the new century.The current research of big data contains weakness on common scientific questions,general methodology,and theoretical analysis of real-time ...
Jialin ZHANG, Xiaoming SUN
doaj
Enhanced virtual release advancing algorithm for real-time task scheduling
Journal of Information and Telecommunication, 2018 In real-time task scheduling, response time and time complexity are two of important requirements that draw many attentions. Virtual release advancing (VRA) [Tanaka, K. (2015, June). Virtual release advancing for earlier deadlines.
D. Duy, K. Tanaka
doaj +1 more source
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
Algorithms, 2018 Let R denote a connected region inside a simple polygon, P. By building barriers (typically straight-line segments) in P \ R
Rolf Klein +2 more
doaj +1 more source
Improved meet-in-the-middle attack on ARIA cipher
Tongxin xuebao, 2015 A study on the structure of ARIA cipher is presented. A new 4-round distinguishing property for the meet-in-the-middle attack on ARIA cipher is presented by making use of the multiset and the truncated differential char-acteristic. The new distinguishing
Man-man LI, Shao-zhen CHEN
doaj
Knee point search using cascading top-k sorting with minimized time complexity. [PDF]
ScientificWorldJournal, 2013 Wang Z, Tseng SS.
europepmc +1 more source