相关论文: The Weighted Ambrosio - Tortorelli Approximation S…

Importance sampling is a Monte Carlo method which designs estimators of expectations under a target distribution using weighted samples from a proposal distribution. When the target distribution is complex, such as multimodal distributions…

We associate a weight function to pairs consisting of a smooth and proper variety X over a complete discretely valued field and a differential form on X of maximal degree. This weight function is a real-valued function on the…

In this paper, we use the metric coefficients and the equation of motion in the 2nd post-Newtonian approximation in scalar-tensor theory including intermediate range gravity to derive the deflection of light and compare it with previous…

The ab initio extension of the dynamical vertex approximation (D$\Gamma$A) method allows for realistic materials calculations that include non-local correlations beyond $GW$ and dynamical mean-field theory. Here, we discuss the…

In this paper, we introduce the weighted mixed (sectional, Ricci and scalar) curvature of a foliated (and almost-product) Riemannian manifold $(M,g)$ equipped with a vector field $X$. We define several functions ($q$th Ricci type…

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

Consider a sequence of integral matrices $\mathcal{A}=(A_n)_{n\in\N}$, and a $d$-tuple function ${\bf r}=(r_1,\ldots,r_d)\colon \N\to (0,\frac{1}{2})$. For a fixed vector ${\bm \alpha},$ we are interested in the set $\mathcal{T}_{{\bm…

An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…

Using elementary methods, we define and derive a particular weighted average of the trapezoidal and composite trapezoidal rules and show that this approximation, as well as its composite, is straightforward in computation. This…

One well established method of interactive image segmentation is the random walker algorithm. Considerable research on this family of segmentation methods has been continuously conducted in recent years with numerous applications. These…

This study presents the development of a spatially adaptive weighting strategy for Total Variation regularization, aimed at addressing under-determined linear inverse problems. The method leverages the rapid computation of an accurate…

In this paper, we establish a weighted capillary isoperimetric inequality outside convex sets using the $\lambda_w$-ABP method. The weight function $w$ is assumed to be positive, even, and homogeneous of degree $\alpha$, such that…

In this paper we investigate properties of the family of weight functions and especiallyin the "weight function" model. We etablish in theintroduced algebra topological sharp structures analogous tothe ones introduced in Colombeau algebra.

Let $G=(V, E)$ be a given edge-weighted graph and let its {\em realization} $\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e \in E$ independently with probability $p$. In the {\em stochastic matching} problem, the goal…

The additive model is one of the most popular semiparametric models. The backfitting estimation (Buja, Hastie and Tibshirani, 1989, \textit{Ann. Statist.}) for the model is intuitively easy to understand and theoretically most efficient…

We consider the space (weighted Fourier algebra) of Banach algebra valued functions $A^q_{\omega}(\Gamma,\cX),$ which consists of all Fourier transforms of functions in $L^q_\omega(G,\cX)$. Here $\omega$ is a Beurling-Domar type weight on a…

Given a weighted graph $G$ with $n$ vertices and $m$ edges, and a positive integer $p$, the Hamiltonian $p$-median problem consists in finding $p$ cycles of minimum total weight such that each vertex of $G$ is in exactly one cycle. We…

We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…

Trimming consists of cutting away parts of a geometric domain, without reconstructing a global parametrization (meshing). It is a widely used operation in computer aided design, which generates meshes that are unfitted with the described…

The accuracy and effectiveness of Hermite spectral methods for the numerical discretization of partial differential equations on unbounded domains, are strongly affected by the amplitude of the Gaussian weight function employed to describe…