نتایج جستجو برای: روش lp metric
تعداد نتایج: 466460 فیلتر نتایج به سال:
This paper develops a new integrated ball (pseudo)metric which provides an intermediary between chosen starting d and the Lp distance in general function spaces. Selecting as Hausdorff or Fréchet distances, we introduce shape-sensitive versions of these supremum-based metrics. The metrics allow for finer analyses functional settings, not attainable applying non-integrated directly. Moreover, co...
در دنیای رقابتی امروز، بدون کاهش هزینه ها و افزایش سطح خدمت دهی، حفظ مشتریان فعلی و جذب مشتریان جدید مقدور نیست. در طراحی شبکه های خدماتی مانند بیمارستان ها، مراکز فروش بلیط، ایستگاه های پلیس، سیستم های توزیع بانکی و ...، مکان یابی محل سرویس های خدماتی به طور قابل ملاحظه ای بر روی ازدحام نیازها تاثیر دارد. همچنین مدت زمان انتظار و زمان خدمت دهی کوتاه تر از جمله عوامل مورد توجه مشتری می باشد. بن...
Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...
The above norm induces a metric d where d(f, g) = ‖f − g‖p. Note that d(f, g) = 0 if and only if f = g a.e. μ, in which case we identify f with g. The Lp norm, like all worthy norms, satisfies the triangle inequality: ‖f + g‖p ≤ ‖f‖p + ‖g‖p ; this is precisely Minkowski’s inequality. For random variables X, Y defined on the same probability space and having finite p’th moments, Minkowski’s ineq...
We give a new LP-rounding 1.724-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Shmoys & Swamy. Our work applies a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for Uncapacitated ...
Let a function f 2 L p ?1; 1], 0 < p 1 have 1 r < 1 changes of monotonicity. For all suuciently large n, we construct algebraic polynomials p n of degree n which are comonotone with f, and such that kf ? p n k Lp?1; 1] C(r)! ' 2 (f; n ?1) p , where ! ' 2 (f; n ?1) p denotes the Ditzian-Totik second modulus of smoothness in L p metric.
It is shown that cartesian product and pointwise-sum with a fixed compact set preserve various approximation-theoretic properties. Results for pointwise-sum are proved for F -spaces and so hold for any normed linear space, while the other results hold in general metric spaces. Applications are given to approximation of Lp-functions on the d-dimensional cube, 1 ≤ p < ∞, by linear combinations of...
We discuss the notion of uniform canonical bases, both in an abstract manner and specifically for the theory of atomless Lp lattices. We also discuss the connection between the de nability of the set of uniform canonical bases and the existence of the theory of beautiful pairs (i.e., with the nite cover property), and prove in particular that the set of uniform canonical bases is de nable in al...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید