Approximate Min-Sum Subset Convolution
Exponential-time approximation has recently gained attention as a practical way to deal with the bitter NP-hardness of well-known optimization problems. We study for the first time the $(1 + \varepsilon)$-approximate min-sum subset convolution. This enables exponential-time $(1 + \varepsilon)$-approximation schemes for problems such as minimum-cost $k$-
openaire +2 more sources
Comments on data balance, test-set accounting, and thresholded reporting in an adaptive convolution neural network model for tuberculosis detection and diagnosis using semantic segmentation. [PDF]
Pol J RadiolPastore EP.
europepmc +1 more source
The shifted convolution problem in function fields. [PDF]
Math AnnFlorea A, Lalín M, Malik A, Sahay A.
europepmc +1 more source
Computing Rate-Distortion Functions of Continuous Memoryless Sources via Discrete Algorithms: An Integrated Scheme with Convergence Guarantee and Algorithmic Acceleration. [PDF]
Entropy (Basel)Chen L +5 more
europepmc +1 more source
Arithmetical sums in regular convolutions.
Journal für die reine und angewandte Mathematik (Crelles Journal), 1978 openaire +2 more sources
Global Results for Weakly Dispersive KP-II Equations on the Cylinder. [PDF]
Arch Ration Mech AnalHerr S, Schippa R, Tzvetkov N.
europepmc +1 more source
Lightweight Visual Localization of Steel Surface Defects for Autonomous Inspection Robots Based on Improved YOLOv10n. [PDF]
Sensors (Basel)Tong J +5 more
europepmc +1 more source
The finite element neural network method to simulate two dimensional partial differential equations and perform parameter identification. [PDF]
Sci RepAbda M +7 more
europepmc +1 more source