1) bottom-up computation 自底向上计算 2) bottom-up 自底向上 1. An Optimized Bottom-Up Time Series Segmentation Algorithm; 一种优化的自底向上时间序列分段算法 2. This paper proposes the method of monitoring the k-nearest neighbors,which adopts a predicted-speed policy and abottom-upupdate R-...
Minker. Bottom-up computation of perfect models for dis- junctive theories. Journal of Logic Programming, 1995. To appear.J.A. Fernandez and J. Minker. Bottom-up computation of perfect models for disjunctive theories. Journal of Logic Programming , 25(1):33–51, October, 1995. MathSciNet ...
Raghu Ramakrishnan: Bottom-Up Computation of Sparse and Iceberg CUBEs We introduce the Iceberg-CUBE problem as a reformulation of the datacube (CUBE) problem. The Iceberg-CUBE problem is to compute only those group-by partiti... KS Beyer 被引量: 1013发表: 1999年 Computing Iceberg Cubes by ...
Transformation-Based Bottom-Up Computation of the Well-Founded Model We present a framework for expressing bottom-up algorithms to compute the well-founded model of non-disjunctive logic programs. Our method is based on the ... S Brass,J Dix,B Freitag,... - 《Theory & Practice of Logic Pr...
2) bottom-up recognizer 自底向上识别算法3) bottom-up method 自底向上法 1. Platform design of function similar products based on bottom-up method; 基于自底向上法的功能相似产品平台设计4) bottom up computation 自底向上计算5) bottom-up scheme 自底向上方法 例句>> ...
热度: 经典堆排序之变种:BOTTOM—UP算法 一筮粤耀 Jf(r.h(0)_.ah[-- Ⅷ 0) r~V(urfl0//()J★su骷★ 用同样的方法.可实现将一块扩展内存区数据传入 标准内存: ();(略) 四,实际应用 作者用上述方法,实现了将超大虚屏图象存入 扩展内存.并同标准内存中虚屏窗El交换数据.效果 ...
Atomically Precise Bottom-up Fabrication of Graphene Nanoribbons Special Feature: The Relative Contributions to Top-Down and Bottom-Up Forces in Population and Community Ecology Bottom-Up Computation of Sparse and Iceberg CUBEs FCA-Merge : Bottom-Up Merging of Ontologies...
The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the ...
Phase I is bottom-up computation. We first compute a number of edge segments from the input image, and es- timate a number of vanish points (usually three) using a method studied in [9]. Thus the line segments are divided into three line sets illustrated in Fig. 4. Then we gener-...
We present a model and a hardware architecture for the computation of bottom-up inherent visual attention for FPGA. The bottom-up inherent attention is generated including local energy, local orientation maps, and red-green and blue-yellow color opponencies. In this work, we describe the simplif...