Related papers: Direct and Binary Direct Bases for One-set Updates…
This paper addresses optimal feedback selection for generic arbitrary pole placement of structured systems when each feedback edge is associated with a cost. Given a structured system and a feedback cost matrix, our aim is to find a…
We consider extension of a closure system on a finite set S as a closure system on the same set S containing the given one as a sublattice. A closure system can be represented in different ways, e.g. by an implicational base or by the set…
This paper shows that discrete Morse-Bott theory can be developed as a natural extension of R. Forman's discrete Morse theory by improving the definition of the discrete Morse-Bott function introduced by S. Yaptieu. To this end, we…
This paper is concerned with the relationship between the discrete and the continuous decreasing minimization problem on base-polyhedra. The continuous version (under the name of lexicographically optimal base of a polymatroid) was solved…
With the goal of taking a step toward the construction of astrophysically realistic initial data for numerical simulations of black holes, we for the first time derive a family of fully general relativistic initial data based on…
We propose an enhancement to Benders decomposition (BD) that generates valid inequalities for the convex hull of the Benders reformulation, addressing the limitation that classical BD cuts are typically tight only for the continuous…
A definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn clauses. The class of definite Horn theories is known to be…
We study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the R\'enyi system with one real base. We focus on the so-called…
A new approach to construct initial data for binary systems with neutron star components is introduced. The approach is a generalization of the puncture initial data method for binary black holes based on Bowen-York solutions to the…
We consider two problems on simplicial complexes: the Optimal Bounded Chain Problem and the Optimal Homologous Chain Problem. The Optimal Bounded Chain Problem asks to find the minimum weight $d$-chain in a simplicial complex $K$ bounded by…
Learning compact binary codes for image retrieval problem using deep neural networks has recently attracted increasing attention. However, training deep hashing networks is challenging due to the binary constraints on the hash codes. In…
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…
This paper introduces an abductive framework for updating knowledge bases represented by extended disjunctive programs. We first provide a simple transformation from abductive programs to update programs which are logic programs specifying…
This work proposes a general strategy for solving possibly nonlinear problems arising from implicit time discretizations as a sequence of explicit solutions. The resulting sequence may exhibit instabilities similar to those of the base…
Dynamical Ising machines achieve accelerated solving of complex combinatorial optimization problems by remapping the convergence to the ground state of the classical spin networks to the evolution of specially constructed continuous…
Quantization based model compression serves as high performing and fast approach for inference that yields models which are highly compressed when compared to their full-precision floating point counterparts. The most extreme quantization…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
Networked discrete dynamical systems are often used to model the spread of contagions and decision-making by agents in coordination games. Fixed points of such dynamical systems represent configurations to which the system converges. In the…
This paper considers real-time control and learning problems for finite-dimensional linear systems under binary-valued and randomly disturbed output observations. This has long been regarded as an open problem because the exact values of…
This technical report presents a direct proof of Theorem~1 in [1] and some consequences that also account for (20) in [1]. This direct proof exploits a state space change of basis which replaces the coupled difference equations (10) in [1]…