Symmetrization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetrization, convexity and applications

Based on permutation enumeration of the symmetric group and ‘generalized’ barycentric coordinates on arbitrary convex polytope, we develop a technique to obtain symmetrization procedures for functions that provide a unified framework to derive new Hermite-Hadamard type inequalities. We also present applications of our results to the Wright-convex functions with special emphasis on their key rol...

متن کامل

Symmetrization and Rademacher Complexity

Let’s first see how primitive covers were inadequate. Recall that a function class G is a primitive cover for a function class F at scale > 0 over some set S if: • G ⊆ F , • |G| <∞, and • for every f ∈ F there exists g ∈ G with supx∈S |g(x)− f(x)| ≤ . Last class, we gave a generalization bound for classes with primitive covers (basically, primitive covers give discretizations, and then we apply...

متن کامل

Symmetrizing The Symmetrization Postulate

Reasonable requirements of (a) physical invariance under particle permutation and (b) physical completeness of state descriptions [1], enable us to deduce a Symmetric Permutation Rule(SPR): that by taking care with our state descriptions, it is always possible to construct state vectors (or wave functions) that are purely symmetric under pure permutation for all particles, regardless of type di...

متن کامل

Time Symmetrization Meta-Algorithms

We present two types of meta-algorithm that can greatly improve the accuracy of existing algorithms for integrating the equations of motion of dynamical systems. The first meta-algorithm takes an integrator that is time-symmetric only for constant time steps, and ensures time-symmetry even in the case of varying time steps. The second metaalgorithm can be applied to any self-starting integratio...

متن کامل

Symmetrization of Bernoulli

Let X be a random variable. We shall call an independent random variable Y to be a symmetrizer forX , ifX+Y is symmetric around zero. If Y is independent copy of −X , it is obviously a symmetrizer. A random variable is said to be symmetry resistant if the variance of any symmetrizer Y , is never smaller than the variance of X itself. For example, let X be a Bernoulli(p) random variable. If p = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Graphics

سال: 2007

ISSN: 0730-0301,1557-7368

DOI: 10.1145/1276377.1276456