资源分类
》 资源 》论文》Fast Resampling Weighted v-Statistics

Fast Resampling Weighted v-Statistics

2020-01-13 | |  47 |   30 |   0

Abstract

In this paper, a novel and computationally fast algorithm for computing weighted 图片.png-statistics in resampling both univariate and multivariate data is proposed. To avoid any real resampling, we have linked this problem with finite group action and converted it into a problem of orbit enumeration. For further computational cost reduction, an efficient method is developed to list all orbits by their symmetry orders and calculate all index function orbit sums and data function orbit sums recursively. The computational complexity analysis shows reduction in the computational cost from 图片.png level to low-order polynomial level.

上一篇：A Geometric take on Metric Learning

下一篇：One Permutation Hashing

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...