The computational complexity of the Chow form
We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system defining the ...
Jeronimo, Gabriela +3 more
core +1 more source
Splitting Choice and Computational Complexity Analysis of Decision Trees. [PDF]
Zhao X, Nie X.
europepmc +1 more source
Hexagonal-Grid-Layout Image Segmentation Using Shock Filters: Computational Complexity Case Study for Microarray Image Analysis Related to Machine Learning Approaches. [PDF]
Baloi A +5 more
europepmc +1 more source
Object Query Computing Optimization in the Dynamic Information Model DIM
The problem of algorithm for organization of the object queries execution [1] for a new object DBMS technology DIM [2] is considered such that the computational complexity of the queries execution is as little as possible.
V. S. Roublev
doaj
A Novel, Low Computational Complexity, Parallel Swarm Algorithm for Application in Low-Energy Devices. [PDF]
Długosz Z +3 more
europepmc +1 more source
Spiking Neural Network with Linear Computational Complexity for Waveform Analysis in Amperometry. [PDF]
Szczęsny S, Huderek D, Przyborowski Ł.
europepmc +1 more source
GEOMScope: Large Field-of-view 3D Lensless Microscopy with Low Computational Complexity. [PDF]
Tian F, Hu J, Yang W.
europepmc +1 more source
A Computable Economist’s Perspective on Computational Complexity [PDF]
A computable economist.s view of the world of computational complexity theory is described. This means the model of computation underpinning theories of computational complexity plays a central role.
K. Vela Velupillai
core
Computational Complexity Reduction of Neural Networks of Brain Tumor Image Segmentation by Introducing Fermi-Dirac Correction Functions. [PDF]
Tai YL, Huang SJ, Chen CC, Lu HH.
europepmc +1 more source
Computational Complexity in Additive Hedonic Games [PDF]
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive.
Dinko Dimitrov, Shao-Chin Sung
core

