Access level-the permission for code to make use of the element.

In contrast, people given the importance attached to text compression is far not enough.

相比之下, 人们给予文本压缩的重视程度远为不够.

LZ algorithm is widely used in text compression.

LZ算法在文本压缩领域应用广泛.

Haffman text compression source code integrity, and can be used directly.

哈夫曼文本压缩源代码的完整性, 并可以直接使用.

Currently, the researchs of text compression and retrieval attract people's attention.

目前针对文本文件压缩和检索的研究已经受到大家的关注.

For the problem of Chinese string matching, a fast multiple pattern matching algorithm was provided.

针对中文字串匹配问题, 提出一种快速多模式匹配算法.

For the problem of Chinese string matching, an improved multiple pattern matching algorithm is provided.

针对中文字串匹配问题, 提出了一种改进的多模式匹配算法.

Traditional string matching algorithms cannot be efficiently applied to the q-attribute string matching problem.

传统的字串比对方法并无法直接应用在q重字串比对的问题上.

The master string matching algorithm.

掌握串的匹配算法.

An improved image recognition and registration algorithm based on convex hull and affine invariant was presented.

提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法.

That is multi-direction extreme value approximate convex hull algorithm, and is called MDEV for short.

提出并实现了平面点集凸壳的一种新的近似算法 —— 多方向极值法.

Classic convex hull algorithm. JAVA language. Absolutely correct.

经典的凸包算法. JAVA语言编写. 绝对正确.

Minimum Manhattan network problem is put forward in 1999 a world-class computational geometry important conjecture.

最小曼哈顿网络问题,是1999年提出的 世界级 计算几何重要猜想.

Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry.

摘要简单多边形凸单元剖分是计算几何的基本问题之一,剖分算法在许多领域均有较广泛的应用.

Being a basic structure of computational geometry, convex hull is important to data analysis of GIS.

凸壳作为计算几何的一种基本的结构,对GIS的数据分析有着重要作用.

This Handbook provides an overview of key concepts and results in Computational Geometry.

这本手册提供核心概念的概述并且导致计算几何学.

In this paper, the edge coloring of some multiple join of graphs are studied.

本文研究了若干多重联图的边染色.

Secondly, it gives two weighted convex cone independent set problems.

本文提出两个赋权凸锥独立集合问题.

The VRP and the network flow problem are all famous network optimization problems.

车辆路径问题和网络流问题都是非常著名的网络优化问题.

Chapter nine considers the minimal cost network flow problem from the simplex method point of view.

第九章从单纯形方法的观点考虑网络流问题的最小化.

Then a brand-new network flow management method by multi-agent technology is proposed to solve the problems.

在此基础上,引入多 agent 技术来解决网络流量管理难题.