Search
Search Results
-
Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces
In the context of support vector machines, identifying the support vectors is a key issue when dealing with large data sets. In Camelo et al. (Ann...
-
Polynomial Total Positivity and High Relative Accuracy Through Schur Polynomials
In this paper, Schur polynomials are used to provide a bidiagonal decomposition of polynomial collocation matrices. The symmetry of Schur polynomials...
-
Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
Matrix skeletonizations like the interpolative and CUR decompositions provide a framework for low-rank approximation in which subsets of a given...
-
-
Accurate computations with matrices related to bases {tieλt}
The total positivity of collocation, Wronskian and Gram matrices corresponding to bases of the form ( e λ t , t e λ t ,…, t n e λ t ) is analyzed. A bidiagonal...
-
General-purpose preconditioning for regularized interior point methods
In this paper we present general-purpose preconditioners for regularized augmented systems, and their corresponding normal equations, arising from...
-
-
Classification Lists
This chapter displays lists of classified objects.
-
Two-machine flow shop scheduling with convex resource consumption functions
We consider a two-machine flow shop scheduling problem in which the processing time of each operation is inversely proportional to the power of the...
-
Sectionable Tournaments: their Topology and Coloring
We provide a detailed study of topological and combinatorial properties of sectionable tournaments. This class forms an inductively constructed...
-
A Training Set Subsampling Strategy for the Reduced Basis Method
We present a subsampling strategy for the offline stage of the Reduced Basis Method. The approach is aimed at bringing down the considerable offline...
-
Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases
In this paper we deduce a bidiagonal decomposition of Gram and Wronskian matrices of geometric and Poisson bases. It is also proved that the Gram...
-
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan
We consider the problem of listing all spanning trees of a graph G such that successive trees differ by pivoting a single edge around a vertex. Such...
-
A novel strict color image authentication scheme based on dual-complex LU decomposition
In this paper, we construct the dual-complex Gauss transformation and propose novel algorithms for LU decomposition and partial pivoting LU...
-
-
Sparse Matrix Ordering Algorithms
So far, our focus has been on the theoretical and algorithmic principles involved in sparse Gaussian elimination-based factorizations. To limit the...
-
Reconstruction of low-rank aggregation kernels in univariate population balance equations
The dynamics of particle processes can be described by population balance equations which are governed by phenomena including growth, nucleation,...
-
A mathematical programming approach for recognizing binet matrices
The development of an efficient and practical method to recognize matrices originating from generalized graphs, in the same way that network matrices...
-
