14 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…
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…
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…
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…
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)…
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…