Results 21 to 30 of about 151,418 (244)
Fine-grained Complexity Analysis of Two Classic TSP Variants [PDF]
International Colloquium on Automata, Languages and Programming, 2016 We analyze two classic variants of the TRAVELING SALESMAN PROBLEM (TSP) using the toolkit of fine-grained complexity. Our first set of results is motivated by the BITONIC TSP problem: given a set of n points in the plane, compute a shortest tour ...
M. D. Berg +3 more
semanticscholar +1 more source
Coordinate descent with arbitrary sampling I: algorithms and complexity† [PDF]
Optim. Methods Softw., 2014 We study the problem of minimizing the sum of a smooth convex function and a convex block-separable regularizer and propose a new randomized coordinate descent method, which we call ALPHA.
Zheng Qu, Peter Richtárik
semanticscholar +1 more source
Computational RNA secondary structure design: empirical complexity and improved methods
BMC Bioinformatics, 2007 Background We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various classes of RNA structures as the size of the target structure is increased ...
Condon Anne +2 more
doaj +1 more source
Joint likelihood estimation and model order selection for outlier censoring
IET Radar, Sonar & Navigation, 2021 This study deals with the problem of outlier censoring from the secondary data in a radar scenario, where the number of outliers is unknown. To this end, a procedure consisting of joint likelihood estimation and statistical model order selection (MOS) is
Seyed Mohammad Karbasi
doaj +1 more source
Mathematics, 2022 In the supervised classification area, the algorithm selection problem (ASP) refers to determining the a priori performance of a given classifier in some specific problem, as well as the finding of which is the most suitable classifier for some tasks ...
Claudia C. Tusell-Rey +5 more
doaj +1 more source
Generalized Queue-Aware Resource Management and Scheduling for Wireless Communications
IEEE Access, 2015 The general problem of a queue-aware radio resource management and scheduling design is investigated for wireless communications under quasi-static fading channel conditions.
Ning Wang +3 more
doaj +1 more source
A Finite Regime Analysis of Information Set Decoding Algorithms
Algorithms, 2019 Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric cryptosystems.
M. Baldi +4 more
semanticscholar +1 more source
A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization [PDF]
SIAM Journal on Optimization, 2020 Error bound analysis, which estimates the distance of a point to the solution set of an optimization problem using the optimality residual, is a powerful tool for the analysis of first-order optimization algorithms.
Jiawei Zhang, Zhiquan Luo
semanticscholar +1 more source
Wasserstein-based methods for convergence complexity analysis of MCMC with applications
The Annals of Applied Probability, 2018 Over the last 25 years, techniques based on drift and minorization (d&m) have been mainstays in the convergence analysis of MCMC algorithms. However, results presented herein suggest that d&m may be less useful in the emerging area of convergence ...
Qian Qin, J. Hobert
semanticscholar +1 more source
Spatial Cluster Analysis by the Bin-Packing Problem and DNA Computing Technique
Discrete Dynamics in Nature and Society, 2013 Spatial cluster analysis is an important data mining task. Typical techniques include CLARANS, density- and gravity-based clustering, and other algorithms based on traditional von Neumann's computing architecture.
Xiyu Liu, Jie Xue
doaj +1 more source