Results 111 to 120 of about 22,856,606 (379)

Hypergraphs in m-Polar Fuzzy Environment

open access: yesMathematics, 2018
Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set
Muhammad Akram, Gulfam Shahzadi
doaj   +1 more source

Average case analysis of marking algorithms [PDF]

open access: yes, 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 in Deep Learning Models

open access: yesProcedia Computer Science, 2022
Bhoomi Shah, H. Bhavsar
semanticscholar   +1 more source

Thermostable neutral metalloprotease from Geobacillus sp. EA1 does not share thermolysin's preference for substrates with leucine at the P1′ position

open access: yesFEBS Letters, EarlyView.
Knowing how proteases recognise preferred substrates facilitates matching proteases to applications. The S1′ pocket of protease EA1 directs cleavage to the N‐terminal side of hydrophobic residues, particularly leucine. The S1′ pocket of thermolysin differs from EA's at only one position (leucine in place of phenylalanine), which decreases cleavage ...
Grant R. Broomfield   +3 more
wiley   +1 more source

Holographic complexity for time-dependent backgrounds

open access: yesPhysics Letters B, 2016
Accepted for publication in Physics letter ...
Davood Momeni   +4 more
openaire   +5 more sources

Center of Trapezoid Graph: Application in Selecting Center Location to Set up a Private Hospital

open access: yesMathematics
The central location problem is a key aspect of graph theory, with a significant importance in various applications and studies within the field. The center of a graph is made up of nodes that have the smallest eccentricity, where eccentricity is defined
Shaoli Nandi   +5 more
doaj   +1 more source

Efficient and Accurate Hausdorff Distance Computation Based on Diffusion Search

open access: yesIEEE Access, 2018
The Hausdorff distance (HD) between two point sets is widely used in similarity measures, but the high computational cost of HD algorithms restrict their practical use.
Dejun Zhang   +3 more
doaj   +1 more source

Exploring lipid diversity and minimalism to define membrane requirements for synthetic cells

open access: yesFEBS Letters, EarlyView.
Designing the lipid membrane of synthetic cells is a complex task, in which its various roles (among them solute transport, membrane protein support, and self‐replication) should all be integrated. In this review, we report the latest top‐down and bottom‐up advances and discuss compatibility and complexity issues of current engineering approaches ...
Sergiy Gan   +2 more
wiley   +1 more source

Reconstruction of Optical Coherence Tomography Images from Wavelength Space Using Deep Learning

open access: yesSensors
Conventional 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

Optimisation of mobile intelligent terminal data pre-processing methods for crowd sensing

open access: yesCAAI Transactions on Intelligence Technology, 2018
Sensor data pre-processing is an essential phase of crowd sensing application. Existing studies do not effectively solve the problem, and there still exist various sensor data pre-processing optimisation problems at the acquisition end in crowd-sensing ...
Min Huang   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy