Related papers: The Weighted Ambrosio - Tortorelli Approximation S…
We prove that any function in $GSBD^p(\Omega)$, with $\Omega$ a $n$-dimensional open bounded set with finite perimeter, is approximated by functions $u_k\in SBV(\Omega;\mathbb{R}^n)\cap L^\infty(\Omega;\mathbb{R}^n)$ whose jump is a finite…
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in a graph $G=(V,E)$. This is a fundamental graph problem with classical sequential algorithms that run in $\tilde{O}(n^3)$ and $\tilde{O}(mn)$ time where…
The well-known Caputo fractional derivative and the corresponding Caputo fractional integral occur naturally in many equations that model physical phenomena under inhomogeneous media. The relationship between the two fractional terms can be…
Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…
This paper presents a novel method for polynomial approximation (Hermite approximation) using the fusion of value and derivative information. Therefore, the least-squares error in both domains is simultaneously minimized. A covariance…
We consider robust estimation of wrapped models to multivariate circular data that are points on the surface of a $p$-torus based on the weighted likelihood methodology.Robust model fitting is achieved by a set of weighted likelihood…
In this paper, we propose a perceptually-guided visualization sharpening technique. We analyze the spectral behavior of an established comprehensive perceptual model to arrive at our approximated model based on an adapted weighting of the…
In this study, we examine the convergence characteristics of the Max-Product Kantrovich type exponential sampling series within the weighted space of log-uniformly continuous and bounded functions. The research focuses on deriving…
We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results…
In this paper, we define some weighted sums of the alternating multiple $T$-values (AMTVs), and study several duality formulas for them by using the tools developed in our previous papers. Then we introduce the alternating version of the…
Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal in a polynomial ring $R$. We give the formula of Castelnuovo-Mumford regularity of $R/I(\mathcal{D})$ when $\mathcal{D}$ is a weighted oriented path…
We analyze integral representation and $\Gamma$-convergence properties of functionals defined on \emph{piecewise rigid functions}, i.e., functions which are piecewise affine on a Caccioppoli partition where the derivative in each component…
We give direct and inverse theorems for the weighted approximation of functions with endpoint singularities by combinations of Bernstein polynomials by the $r$th Ditzian-Totik modulus of smoothness $\omega_\phi^{r}(f,t)_w$ where $\phi$ is…
We give a H\"ormander type $L^2-$estimate for the $\bar{\partial}-$equation with respect to the measure $\delta_\Omega^{-\alpha}dV$, $\alpha<1$, on any bounded pseudoconvex domain with $C^2-$boundary. Several applications to the function…
Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-\'Emery and the $d$-th non-zero Laplacian eigenvalue $\lambda_d$ close to $K$, with $d$ being the maximal…
Weighted Gaussian Curvature is an important measurement for images. However, its conventional computation scheme has low performance, low accuracy and requires that the input image must be second order differentiable. To tackle these three…
Methods of approximate Bayesian computation (ABC) are increasingly used for analysis of complex models. A major challenge for ABC is over-coming the often inherent problem of high rejection rates in the accept/reject methods based on…
Orthogonal Monte Carlo (OMC) is a very effective sampling algorithm imposing structural geometric conditions (orthogonality) on samples for variance reduction. Due to its simplicity and superior performance as compared to its Quasi Monte…
We discuss approximation of extremal functions by polynomials in the weighted Bergman spaces $A^p_\alpha$ where $-1 < \alpha < 0$ and $-1 < \alpha < p-2$. We obtain bounds on how close the approximation is to the true extremal function in…
Umbral theory, formulated in its modern version by S. Roman and G.~C. Rota, has been reconsidered in more recent times by G. Dattoli and collaborators with the aim of devising a working computational tool in the framework of special…