Results 31 to 40 of about 4,693,176 (171)

Edge decompositions of multigraphs into multi-2-paths [PDF]

open access: yesOpuscula 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  

Second-order DE algorithm

open access: yesCAAI Transactions on Intelligence Technology, 2019
Differential evolution (DE) is a robust, efficient and simple evolutionary algorithm for various optimisation and engineering problems. It has several outstanding features such as low time complexity, ease to use and robust steadiness.
Xinchao Zhao   +3 more
doaj   +1 more source

Shape matching and object recognition using common base triangle area

open access: yesIET 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

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms [PDF]

open access: yes, 2019
Many graph parameters can be expressed as homomorphism counts to fixed target graphs; this includes the number of independent sets and the number of k-colorings for any fixed k.
A Göbel   +21 more
core   +1 more source

Time-Optimal Gathering under Limited Visibility with One-Axis Agreement

open access: yesInformation, 2021
We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles following the well-celebrated classic oblivious robots model.
Pavan Poudel, Gokarna Sharma
doaj   +1 more source

Evaluating the Performance of Eigenface, Fisherface, and Local Binary Pattern Histogram-Based Facial Recognition Methods under Various Weather Conditions

open access: yesTechnologies, 2021
Facial recognition (FR) in unconstrained weather is still challenging and surprisingly ignored by many researchers and practitioners over the past few decades.
Md Manjurul Ahsan   +4 more
doaj   +1 more source

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis [PDF]

open access: yes, 2014
Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al.
D. Lau   +14 more
core   +2 more sources

Dendrite Net with Acceleration Module for Faster Nonlinear Mapping and System Identification

open access: yesMathematics, 2022
Nonlinear mapping is an essential and common demand in online systems, such as sensor systems and mobile phones. Accelerating nonlinear mapping will directly speed up online systems.
Gang Liu   +5 more
doaj   +1 more source

Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]

open access: yes, 2016
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier   +2 more
core   +3 more sources

New Classes of Distributed Time Complexity

open access: yes, 2018
A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) -- have advanced our understanding of one of the most fundamental questions in ...
Balliu, Alkida   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy