搜索结果: 1-15 共查到“计算机科学技术 K-D Tree”相关记录48条 . 查询时间(0.045 秒)
Regular tree expressions are a natural formalism for describing the sets of tree-structured values that commonly arise in programs; thus,they are well-suited to applications in program analysis. We de...
Research on the Distributed Parallel Spatial Indexing Schema Based on R-TREE
Distributed parallel computing environment Parallel spatial indexing
2015/12/3
As one of the key technologies for improving the efficiency of parallel processing of a huge volume spatial data under the distributed parallel computing environment, the parallel spatial indexing mec...
Optimal Wire and Transistor Sizing for Circuits with Non-Tree Topology
Optimal Wire Transistor Sizing Circuits Non-Tree Topology
2015/8/14
Conventional methods for optimal sizing of wires and transistors use linear RC circuit models and the Elmore delay as a measure of signal delay. If the RC circuit has a tree topology the sizing proble...
Automatic Wrapper Adaptation by Tree Edit Distance Matching
Distributed information network Web data programs Web pages
2015/7/15
Information distributed through the Web keeps growing faster day by day, and for this reason, several techniques for extracting Web data have been suggested during last years. Often, extraction tasks ...
Visualization Analysis of Multi-Domain Access Control Policy Integration Based on Tree-Maps and Semantic Substrates
Cross-Domain Information Exchange Visualization Analysis Tree-Maps Semantic Substrates
2013/1/28
The complexity of multi-domain access control policy integration makes it difficult to understand and manage the policy conflict information. The policy information visualization technology can expres...
Syntax-Tree Regular Expression Based DFA FormalConstruction
Automata Theory Compiler Verification Lexical Analyzer Automated Tools Z Specification
2013/1/28
Compiler is a program whose functionality is to translate a computer program written in source language into an equivalent machine code. Compiler construction is an advanced research area because of i...
The abelian sandpile model on a random binary tree
abelian sandpile model random binary tree
2012/2/24
We study the abelian sandpile model on a random binary tree. Using a transfer matrix approach introduced by Dhar & Majumdar, we prove exponential decay of correlations, and in a small supercritical re...
基于SSC-tree流聚类的入侵检测算法
入侵检测 聚类 数据流 高速网络
2013/8/31
由于数据流具有快速、无限、突发等特性，实现高速网络下的实时入侵检测已成为一个难题。设计一种维持数据流概要特征的相似搜索聚类树(similarity search cluster-tree, SSC-tree)结构，在此基础上提出一种基于SSC-tree的流聚类算法用于高速网络的入侵检测。为适应高速、突发到达的数据流，算法采用了链式缓存、捎带处理和局部聚类策略。SSC-tree中的链式缓存区用于临时...
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string transla-tion, which converts a source tree to a target string. Without reconstructing TAG deriva-tions explicitly, our rule e...
Rule Markov Models for Fast Tree-to-String Translation
Rule Markov Models Fast Tree-to-String Translation
2013/4/22
Most statistical machine translation systems rely on composed rules (rules that can be formed out of smaller rules in the grammar).Though this practice improves translation by weakening independence a...
一种基于VARdnn-Tree的反向最近邻查询方法
反向最近邻查询 索引结构 量化压缩
2010/8/26
空间数据库中反向最近邻查询在低维查询时一般利用基于R-Tree的改进树作为索引结构，由于树型索引结构本身的限制，R-Tree等索引结构的查询在高维中都会出现维数灾难。针对这个问题，提出了一种基于VARdnn-Tree的索引结构，采用量化压缩的方法存储数据，能够有效地支持高维查询。
Efficient Incremental Decoding for Tree-to-String Translation
Efficient Incremental Decoding Tree-to-String Translation
2013/4/22
Syntax-based translation models should in principlebe efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of language model integr...
The past several years have witnessed rapid ad-vances in syntax-based machine translation, which exploits natural language syntax to guide transla-tion. Depending on the type of input, most of these e...
树状网络上带度约束的k-tree core问题
动态规划 局部根核 贪婪思想
2009/12/10
考虑到在实际应用中，由于计算机和通信网络中一般每个设备的处理能力是有限的，在k-tree core问题的基础上，提出了同时带有度约束的k-tree core问题，即k-tree core中的每个节点在子树中的度不超过给定常数q，记为q-DTC（k）（Degree constrained Tree Core）。利用动态规划的方法，采用最优化原则先找出文中所定义的局部根核集，然后利用贪婪思想对不满足度...