28 papers · ranked by Valyu relevance
Fuchao Wu, Ming Zhang, Guanghui Wang, Zhanyi Hu + 1 more
Line triangulation, a classical geometric problem in computer vision, is to determine the 3D coordinates of a line based on its 2D image projections from more than two views of cameras with known projection matrices. Compared to point features, line segments are more robust to matching errors, occlusions, and image…
Jing He, Qi-wei Kong, Ho-Chung Lui, Haitao Liu + 1 more
The definition of factor space and a unified optimization based classification model were developed for linear programming and supervised learning. Intelligent behaviour appeared in a decision process can be treated as a moving point y, the dynamic state observed and controlled by the agent, moving in a factor space…
Yair Censor, Yehuda Zur
Linear superiorization (abbreviated: LinSup) considers linear programming (LP) problems wherein the constraints as well as the objective function are linear. It allows to steer the iterates of a feasibilityseeking iterative process toward feasible points that have lower (not necessarily minimal) values of the objective…
Oliver Serang, Jérémie Bourdon
Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a…
Sebastian Schmidt, Jarno N. Alanko
A fundamental operation in computational genomics is to reduce the input sequences to their constituent k-mers. For maximum performance of downstream applications it is important to store the k-mers in small space, while keeping the representation easy and efficient to use (i.e. without k-mer repetitions and in plain…
Yu Huo, Hongpei Li, Xiao Wang, Xiaochen Du + 1 more
When analysing two-dimensional data sets, scientists are often interested in regions where one variable depends linearly on the other. Typically they use an ad hoc method to do so. Here we develop a statistically rigorous, Bayesian approach to infer the optimal partitioning of a data set into contiguous piece-wise…
Marijn van Vliet, Riitta Salmelin
Linear machine learning models “learn” a data transformation by being exposed to examples of input with the desired output, forming the basis for a variety of powerful techniques for analyzing neuroimaging data. However, their ability to learn the desired transformation is limited by the quality and size of the example…
Authors not listed
We present a fast, asymptotically linear-scaling implementation of the perturbative quadruples energy correction in coupled-cluster theory using local natural orbitals. Our work follows the domain-based local pair natural orbital (DLPNO) approach previously applied to lower levels of excitations in coupled-cluster…
Theodoros Anagnostopoulos, Evanthia Zervoudi, Christos Anagnostopoulos, Apostolos Christopoulos + 1 more
Linear regression analysis focuses on predicting a numeric regressand value based on certain regressor values. In this context, k-Nearest Neighbors (k-NN) is a common non-parametric regression algorithm, which achieves efficient performance when compared with other algorithms in literature. In this research effort an…
Chunchun Zhao, Sartaj Sahni
Background In the string correction problem, we are to transform one string into another using a set of prescribed edit operations. In string correction using the Damerau-Levenshtein (DL) distance, the permissible edit operations are: substitution, insertion, deletion and transposition. Several algorithms for string…
A. Ya. Rodionov
The purpose of this short article is to bring attention to unifying approach to software and hardware design suggested and developed by Grigory Litvinov, Viktor Maslov and coworkers[1]. The unifying approach is based on observation that many algorithms do not depend on particular models of a numerical domain and even…
Minati De, Subhas C. Nandy, Sasanka Roy
Prune-and-search is an important paradigm for solving many important geometric problems. We show that the general prune-andsearch technique can be implemented where the objects are given in read-only memory. As examples we consider convex-hull in 2D, and linear programming in 2D and 3D. For the convex-hull problem…
Peter L. Bartlett, Chris Junchi Li, Jingfeng Wu, Bin Yu
In the field of optimization, developing accelerated methods for solving minimax and fixed-point problems remains a fundamental challenge. This paper presents a novel family of dual accelerated algorithms that achieve optimal convergence rates for both minimax and fixed-point problems. By exploring new anchoring…
Jiahong Wu, Nan Liu, Wei Kang, Jun Chen + 1 more
In this paper, we study a three-layer wiretap network including the source node in the top layer, N nodes in the middle layer and L sink nodes in the bottom layer. Each sink node recovers the message generated from the source node correctly via the middle layer nodes that it has access to. Furthermore, it is required…
Peihuang Huang, Wenxing Zhu, Longkun Guo
Given a set of sensors distributed on the plane and a set of Point of Interests (POIs) on a line segment, a primary task of the mobile wireless sensor network is to schedule covering the POIs by the sensors, such that each POI is monitored by at least one sensor. For balancing the energy consumption, we study the…
Arya Chakraborty
— While time complexity and space complexity of an algorithm helps to determine its efficiency when time or space needs to be optimized respectively, they fail to determine the more efficient algorithm when time and space both need to be optimized simultaneously. This resulted in the development of the A1-Score Factor…
Chirag Jain, Daniel Gibney, Sharma V. Thankachan
Co-linear chaining has proven to be a powerful technique for finding approximately optimal alignments and approximating edit distance. It is used as an intermediate step in numerous mapping tools that follow seed-and-extend strategy. Despite this popularity, subquadratic time algorithms for the case where chains…
Andrea Brilli, Morteza Kimiaei, Giampaolo Liuzzi, Stefano Lucidi
This paper is devoted to the analysis of worst case complexity bounds for linesearchtype derivative-free algorithms for the minimization of general non-convex smooth functions. We prove that two linesearch-type algorithms enjoy the same complexity properties which have been proved for pattern and direct search…
Patrick Kunzmann
Alignment searches are fast heuristic methods to identify similar regions between two sequences. This group of algorithms is ubiquitously used in a myriad of software to find homologous sequences or to map sequence reads to genomes. Often the first step in alignment searches is k-mer decomposition: listing all…
Kevin Robben, Christopher Cheatum
We report a comprehensive study of the efficacy of least-squares fitting of multidimensional spectra to generalized Kubo lineshape models and introduce a novel least-squares fitting metric, termed the Scale Invariant Gradient Norm (SIGN), that enables a highly reliable and versatile algorithm. The precision of…
Andrew McCluskey
The use of mathematical transformations to reduce non-linear functions to linear problems, which can be tackled with analytical linear regression, is commonplace in the chemistry curriculum. The linearization procedure, however, assumes an incorrect statistical model for real experimental data; leading to biased…
Pier Paolo Poier, Louis Lagardère, Jean-Philip Piquemal
We propose a new strategy to solve the Tkatchenko-Scheffler Many-Body Dispersion (MBD) model’s equations. Our approach overcomes the original O(N**3) computational complexity that limits its applicability to large molecular systems within thecontext of O(N) Density Functional Theory (DFT). First, in order to generate…
Yi Sun
We demonstrate how the combination of a shifted clustering algorithm and a fast-marching- based algorithm is able to generate good approximations of the Minimum Free Energy Path (MFEP) if a Free Energy Landscape (FEL) is given. Then, we show that using this kind of approximation as the MFEP's first guess and the string…
Jose Torres-Jimenez, Nelson Rangel-Valdez, Himer Avila-George, Oscar Carrizalez-Turrubiates + 1 more
'Oscar Carrizalez-Turrubiates' 'M. Sohel Rahman'] Software test suites based on the concept of interaction testing are very useful for testing software components in an economical way. Test suites of this kind may be created using mathematical objects called covering arrays. A covering array, denoted by CA(N; t, k, v)…
Pier Paolo Poir, Louis Lagardère, Jean-Philip Piquemal
We propose a new strategy to solve the Tkatchenko-Scheffler Many-Body Dispersion (MBD) model’s equations. Our approach overcomes the original O(N**3) computational complexity that limits its applicability to large molecular systems within thecontext of O(N) Density Functional Theory (DFT). First, in order to generate…
Myung Cho, Weiyu Xu
The null space condition of sensing matrices plays an important role in guaranteeing the success of compressed sensing. In this paper, we propose new efficient algorithms to verify the null space condition in compressed sensing (CS). Given an (n − m) × n (m > 0) CS matrix A and a positive k, we are interested in…
AKHIL SHAJAN, Madushanka Manathunga, Andreas Goetz, Kenneth Merz
Based on a series of energy minimizations with starting structures obtained from the Baker test set of 30 organic molecules, a comparison is made between various open-source geometry optimization codes that are interfaced with the open-source QUantum Interaction Computational Kernel (QUICK) program for gradient and…
Eric Hermes, Khachik Sargsyan, Habib Najm, Judit Zádor
We present a new algorithm for the optimization of molecular structures to saddle points on the potential energy surface using a redundant internal coordinate system. This algorithm automates the procedure of defining the internal coordinate system, including the handling of linear bending angles, e.g. through the…