نتایج جستجو برای: weak points
تعداد نتایج: 400157 فیلتر نتایج به سال:
We discuss the axioms for vertex algebras and their modules, using formal calculus. Following certain standard treatments, we take the Jacobi identity as our main axiom and we recall weak commutativity and weak associativity. We derive a third, companion property that we call “weak skew-associativity.” This third property in some sense completes an S3-symmetry of the axioms, which is related to...
In this paper, we establish weak continuity results for quasilinear elliptic and subelliptic operators of divergence form, acting on corresponding classes of subharmonic functions. These results are analogous to our earlier results for fully nonlinear k-Hessian operators. From the weak continuity, we derive various potential theoretic results including capacity estimates, potential estimates an...
Given a finite point set P ⊂ R, we call a multiset A a one-sided weak ε-approximant for P (with respect to convex sets), if |P ∩ C|/|P | − |A ∩C|/|A| ≤ ε for every convex set C. We show that, in contrast with the usual (two-sided) weak ε-approximants, for every set P ⊂ R there exists a one-sided weak ε-approximant of size bounded by a function of ε and d.
In this paper we introduce the notion of the fractional weak discrepancy of a poset, building on previous work on weak discrepancy in [5, 8, 9]. The fractional weak discrepancy wdF (P ) of a poset P = (V,≺) is the minimum nonnegative k for which there exists a function f : V → R satisfying (1) if a ≺ b then f(a) + 1 ≤ f(b) and (2) if a ‖ b then |f(a)− f(b)| ≤ k. We formulate the fractional weak...
In this paper, we extend the weak r -net theorem to a kinetic setting where the underlying set of points is moving polynomially with bounded description complexity. We establish that one can find a kinetic analog N of a weak r -net of cardinality O(r d(d+1) 2 log r) whose points are moving with coordinates that are rational functions with bounded description complexity. Moreover, each member of...
In this paper, we propose a geometry histogram modification algorithm to increase the visibility of 3D point models. We define a weak feature as a group of neighboring points yielding the small deviations of normal directions. Geometry histogram is defined as the distribution of the signed distance between a feature point and the locally approximated plane. We equalize and stretch the geometry ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید