相关论文: On Algorithmic Equiresolution and Stratification o…
Entity Resolution constitutes a core data integration task that relies on Blocking in order to tame its quadratic time complexity. Schema-agnostic blocking achieves very high recall, requires no domain knowledge and applies to data of any…
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…
Increasing spatial and temporal resolution of numerical models continues to propel progress in hydrological sciences, but, at the same time, it has strained the ability of modern automatic calibration methods to produce realistic model…
We present SPEC-RE, a new algorithm to sort complex eigenvalues, generated as the solutions to algebraic equations, whose coefficients are analytic functions of one or many, possibly complex parameters. The fact that the eigenvalues are…
We give a $\delta$-constant criterion for equinormalizability of deformations of isolated (not necessarily reduced) curve singularities over smooth base spaces of dimension $\geq 1$. For one-parametric families of isolated curve…
In this paper, we present an advanced analysis of near optimal algorithms that use limited space to solve the frequency estimation, heavy hitters, frequent items, and top-k approximation in the bounded deletion model. We define the family…
A simple iterative scheme is proposed for locating the parameter values for which a 2-parameter family of real symmetric matrices has a double eigenvalue. The convergence is proved to be quadratic. An extension of the scheme to complex…
We introduce the multigraded Hilbert scheme, which parametrizes all homogeneous ideals with fixed Hilbert function in a polynomial ring that is graded by any abelian group. Our construction is widely applicable, it provides explicit…
Constrained maximization of submodular functions poses a central problem in combinatorial optimization. In many realistic scenarios, a number of agents need to maximize multiple submodular objectives over the same ground set. We study such…
Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based…
Hashing is at the heart of large-scale image similarity search, and recent methods have been substantially improved through deep learning techniques. Such algorithms typically learn continuous embeddings of the data. To avoid a subsequent…
In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…
We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active,…
Several convergence results in Hilbert scales under different source conditions are proved and orders of convergence and optimal orders of convergence are derived. Also, relations between those source conditions are proved. The concept of a…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
The diagonal in a product of projective spaces is cut out by the ideal of 2x2-minors of a matrix of unknowns. The multigraded Hilbert scheme which classifies its degenerations has a unique Borel-fixed ideal. This Hilbert scheme is generally…
Machine learning algorithms are optimized to model statistical properties of the training data. If the input data reflects stereotypes and biases of the broader society, then the output of the learning algorithm also captures these…
The aim of this article is to introduce an iterative algorithm for finding a common solution from the set of an equilibrium point for a bifunction and the set of a singularity of an inclusion problem on an Hadamard manifold. We also discuss…