Related papers: Massively Parallel Modular Methods in Commutative …
We develop a framework to construct moduli spaces of $\mathbb{Q}$-Gorenstein pairs. To do so, we fix certain invariants; these choices are encoded in the notion of $\mathbb{Q}$-stable pair. We show that these choices give a proper moduli…
We describe a parallel approximation algorithm for maximizing monotone submodular functions subject to hereditary constraints on distributed memory multiprocessors. Our work is motivated by the need to solve submodular optimization problems…
Partial Isometries are important constructs that help give nontrivial solutions once a simple solution is known. We generalize this notion to Extended Partial Isometries and include operators which have right inverses but no left inverses…
Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…
With the growing complexity and capability of contemporary robotic systems, the necessity of sophisticated computing solutions to efficiently handle tasks such as real-time processing, sensor integration, decision-making, and control…
We introduce Residue Hyperdimensional Computing, a computing framework that unifies residue number systems with an algebra defined over random, high-dimensional vectors. We show how residue numbers can be represented as high-dimensional…
In practice, non-specialized interior point algorithms often cannot utilize the massively parallel compute resources offered by modern many- and multi-core compute platforms. However, efficient distributed solution techniques are required,…
The efficiency of Gr\"obner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on…
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…
We present a version of GMI (Gomory mixed-integer) cuts in a way so that they are derived with respect to a "dual form" mixed-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex…
With this paper we present an extension of our recent ISSAC paper about computations of Groebner(-Shirshov) bases over free associative algebras Z<X>. We present all the needed proofs in details, add a part on the direct treatment of the…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
In this paper, we propose two novel parallel hybrid methods for finding a common element of the set of solutions of a finite family of generalized equilibrium problems for monotone bifunctions $\left\{f_i\right\}_{i=1}^N$ and $\alpha$ -…
Multi-task learning is increasingly used to investigate the association structure between multiple responses and a single set of predictor variables in many applications. In the era of big data, the coexistence of incomplete outcomes, large…
We tackle the problem of multiscale regression for predictors that are spatially or temporally indexed, or with a pre-specified multiscale structure, with a Bayesian modular approach. The regression function at the finest scale is expressed…
Cumulative probability models (CPMs) are a robust alternative to linear models for continuous outcomes. However, they are not feasible for very large datasets due to elevated running time and memory usage, which depend on the sample size,…
In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner…
We present the Polar framework for fully automating the analysis of classical and probabilistic loops using algebraic reasoning. The central theme in Polar comes with handling algebraic recurrences that precisely capture the loop semantics.…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
We study moduli spaces of (semi-)stable representations of one-point extensions of quivers by rigid representations. This class of moduli spaces unifies Grassmannians of subrepresentations of rigid representations and moduli spaces of…