An Optimized Bottom-Up Time Series Segmentation Algorithm;
一种优化的自底向上时间序列分段算法
This paper proposes the method of monitoring the k-nearest neighbors,which adopts a predicted-speed policy and a bottom-up update R-tree index with an update firstly stored in memory.
在时间-距离空间基础上,提出监测第k个最近邻的方法,采取了速度更新预测策略及更新预留内存的自底向上更新的R-树索引结构。
In structural analysis,according to the layout structure of the symbols within the expressions,a method of structural analysis of mathematical expressions which connects the method of "Top-Down" with the way of "Bottom-Up" is applied.
在公式字符识别中,采用了一些适用于公式字符的特殊处理方法;在结构分析中,根据数学公式的结构布局,采用了一种将“自顶向下”和“自底向上”策略相结合的数学公式结构分析方法,实现了数学公式的重用,实验表明,这种方法能取得较好的识别效果。