【24h】

Selection probabilities

机译:选择概率

获取原文
获取原文并翻译 | 示例

摘要

Abstract: In this paper the concept of rank selection probabilities of stack filters is reviewed. If they are known then the output distribution for i.i.d. input follows easily. Amazingly simple connections between different forms of output distribution based on rank selection probabilities and other quantities are derived. These connections lead also to a dramatically faster (O(2$+N$/)) algorithm for finding the rank selection probabilities compared to the traditional (O(N!)) algorithm.!5
机译:摘要:本文综述了堆栈过滤器的等级选择概率的概念。如果它们已知,则i.i.d的输出分布。输入很容易。得出基于等级选择概率和其他数量的不同形式的输出分布之间的惊人简单连接。与传统算法(O(N!))相比,这些连接还导致查找排名选择概率的算法大大提高(O(2 $ + N $ /))。!5

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号