标题: 随机数位树的机率分析
Probabilistic Analysis of Random Digital Trees
作者: 符麦克
FUCHS MICHAEL
国立交通大学应用数学系(所)
关键字: Probabilistic analysis of algorithms;random digital trees;cost measures;variance
公开日期: 2010
摘要: 數位树是计算机科学裡面一种基本的资料结构,在过去30 年内也已经在
很多文章内被讨論。本计划主要讨論随机數位树的机率分析,主要分成兩个部
份。在第一部份,我们将回顾过去的研究成果并提出一个可以简化变異數分析和
更简单的常數表示式的新方法;在第二个部份,我们将提出一个一般化理論可以
得出數位树的形狀參數的极限法则、收敛率和局部极限定理等。
Digital trees are fundamental data structures in computer science and have been analyzed
in numerous papers over the last three decades. The current project is concerned with
probabilistic analysis of digital trees and will consist of two parts: in the first part, we will revisit
most of the previous studies and apply a new approach which is expected to greatly simplify the
analysis of the variance as well as give easier expressions for the constants involved. In the second
part of the project, we will give a general framework for deriving deeper statistical properties such
as limit laws, rates of convergency, local limit theorems, etc. of shape parameter of digital trees.
官方说明文件#: NSC99-2115-M009-007-MY2
URI: http://hdl.handle.net/11536/100730
https://www.grb.gov.tw/search/planDetail?id=2102491&docId=335528
显示于类别:Research Plans


文件中的档案:

  1. 992115M009007MY2(第2年).PDF

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.