Related papers: Lower bounds on the maximum delay margin by analyt…
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load…
In this paper, we consider a load balancing system under a general pull-based policy. In particular, each arrival is randomly dispatched to one of the servers whose queue lengths are below a threshold, if there are any; otherwise, this…
This paper investigates the spectral norm version of the column subset selection problem. Given a matrix $\mathbf{A}\in\mathbb{R}^{n\times d}$ and a positive integer $k\leq\text{rank}(\mathbf{A})$, the objective is to select exactly $k$…
In this paper we establish the interpolatory model reduction framework for optimal approximation of MIMO dynamical systems with respect to the $\mathcal{H}_2$ norm over a finite-time horizon, denoted as the $\mathcal{H}_2(t_f)$ norm. Using…
Submodular maximization under matroid and cardinality constraints are classical problems with a wide range of applications in machine learning, auction theory, and combinatorial optimization. In this paper, we consider these problems in the…
A class of semilinear parabolic reaction diffusion equations with multiple time delays is considered. These time delays and corresponding weights are to be optimized such that the associated solution of the delay equation is the best…
According to conventional wisdom, ambiguity accelerates optimal timing by decreasing the value of waiting in comparison with the unambiguous benchmark case. We study this mechanism in a multidimensional setting and show that in a…
This paper deals with the finite horizon optimal control problem for discrete-time Markov jump linear system with input delay. The correlation among the jumping parameters and the input delay are considered simultaneously, which forms the…
We obtain a lower bound of the degree of irrationality of very general complete intersections over the complex field from the recent results of the first author and Chen--Stapleton. For combining these results, we make a minor adjustment of…
A new approach is presented to the problem of compensating the beam squint effect arising in wideband terahertz (THz) hybrid massive multiple-input multiple-output (MIMO) systems, based on the joint optimization of the phase shifter (PS)…
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…
The simplest way to obtain continuous interpolation between two points in high dimensional space is to draw a line between them. While previous works focused on the general connectivity between model parameters, we explored linear…
Matrices resulting from the discretization of a kernel function, e.g., in the context of integral equations or sampling probability distributions, can frequently be approximated by interpolation. In order to improve the efficiency, a…
Preconditioning has long been a staple technique in optimization, often applied to reduce the condition number of a matrix and speed up the convergence of algorithms. Although there are many popular preconditioning techniques in practice,…
This paper deals with study of the sufficient condition of approximation raring process with mixing by renewall process. We consider use the proved results to practice problem too
Interpolation inequalities for $C^m$ functions allow to bound derivatives of intermediate order $0 < j<m$ by bounds for the derivatives of order $0$ and $m$. We review various interpolation inequalities for $L^p$-norms ($1 \le p \le…
In this paper we present an interpolation-based decoding algorithm to decode a family of maximum rank distance codes proposed recently by Trombetti and Zhou. We employ the properties of the Dickson matrix associated with a linearized…
We introduce a new constructive method for establishing lower bounds on convergence rates of periodic homogenization problems associated with divergence type elliptic operators. The construction is applied in two settings. First, we show…
In this paper a novel hybrid approach for compensating the distortion of any interpolation has been proposed. In this hybrid method, a modular approach was incorporated in an iterative fashion. By using this approach we can get drastic…
A modular method was suggested before to recover a band limited signal from the sample and hold and linearly interpolated (or, in general, an nth-order-hold) version of the regular samples. In this paper a novel approach for compensating…