Related papers: An improved algorithm for Generalized \v{C}ech com…
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate…
Constructing well-behaved Laplacian and mass matrices is essential for tetrahedral mesh processing. Unfortunately, the \emph{de facto} standard linear finite elements exhibit bias on tetrahedralized regular grids, motivating the development…
Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of a feasible solution by the image of some solution in the…
We study the convex lift of Mumford-Shah type functionals in the space of rectifiable currents and we prove a generalized coarea formula in dimension one, for finite linear combinations of SBV graphs. We use this result to prove the…
It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.
By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
We study the problem of approximating the number of $k$-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let…
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to…
In the context of the complex-analytic structure within the open unit disk, that was established in a previous paper, here we establish a simple generalization of the Cauchy-Goursat theorem of complex analytic functions. We do this first…
We consider geodesically convex optimization problems involving distances to a finite set of points $A$ in a CAT(0) cubical complex. Examples include the minimum enclosing ball problem, the weighted mean and median problems, and the…
This paper advocates the use of complex variables to represent votes in the Hough transform for circle detection. Replacing the positive numbers classically used in the parameter space of the Hough transforms by complex numbers allows…
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satisfiability problems for…
In our quest for the design, the analysis and the implementation of a subdivision algorithm for finding the complex roots of univariate polynomials given by oracles for their evaluation, we present sub-algorithms allowing substantial…
Given a directed graph $G = (V, E)$, the $k$-path partition problem is to find a minimum collection of vertex-disjoint directed paths each of order at most $k$ to cover all the vertices of $V$. The problem has various applications in…
The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the $\ell_1$-regularized…
Novel sparse reconstruction algorithms are proposed for beamspace channel estimation in massive multiple-input multiple-output systems. The proposed algorithms minimize a least-squares objective having a nonconvex regularizer. This…