通过调整传感器节点的通信半径，VGSR算法能够在保证网络不失连通性的同时最大限度地降低MAC地址大小。
By adjusting the communication range of sensor nodes, the VGSR algorithm can minimize the size of the MAC address and meanwhile guarantee the connectivity of the sensor network.
有向图剖分算法中，我们需要综合考虑连通性、并行度、负载平衡、通信开销四个目标。
Partitioning algorithms must synthesize the consideration for connectivity, degree of parallelism, load balancing, and communication cost.
该算法考虑到节点能量的有限性、网络的连通性、覆盖无重复性、节点的移动性特点，利用最少的节点达到区域覆盖无盲区。
This algorithm considering the limitation of node energy, network connectivity, no repetitive, node mobility, using the minimum nodes in order to get no blind of area coverage.
算法对3d网格连通性和几何性都提供了有效压缩。
This paper show this algorithm provides an efficient means of compression for both connectivity and geometry of 3d meshes.
该算法首先利用噪声的拓扑连通性实现对图像的脉冲噪声点的标识，然后利用噪声点周围非噪声点的信息，对其进行修复。
Firstly the noise points are identified through the topology connectivity. Then they are repaired by using the non-noise points information.
根据观测星图和导航星所具有的特性- - -星对角距和连通性，构造了最大连通匹配树识别算法。
Construct maximum connection match tree identification algorithm with respect to the characters of observed star map and guide stars -star diagonal distance and connection.
着重研究了系统的连通性、状态切换等几个问题，并结合电网模型对状态枚举算法提出了优化策略。
Mainly studied the system connectivity, the status switching and so on, and putting forward the optimization algorithm for state enumeration method combined with the power network model.
提出了一种新的基于一维最大类间方差和形状连通性的图像分割算法。
A novel image segmentation algorithm based on 1-d maximum inter-class variance and shape connectivity is proposed in this paper.
由于利用了结构的边界线段和结构图的连通性等特点，使得算法既简单又有效。
This algorithm is simple and efficient because the boundary line and connecting property of the structure are applied.
基于空间点集的连通性构造的等价关系，提出一种针对大规模数据集的快速分组算法。
Based on the equivalent relationship constructed from the connectivity, a fast grouping algorithm is presented for mass data set.
传统的基于距离变换的骨架算法不能保证骨架的连通性，需要引入鞍点解决连通问题。
The traditional skeletonization algorithms based on distance transform can not guarantee the connectivity property, so saddle points should be added to solve the connectivity problem.
该算法利用网络中所有节点的局部信息保持网络的连通性，同时，利用最短路径算法计算链接权值的大小来进行拓扑结构的调整。
The algorithm maintains network connectivity only based on locally collected information and adjusts the topology structure according to the shortest-path algorithm by calculating the link weight.
本文基于局部连通性网络容错模型设计了高效的单播、广播和并行容错路由算法。
We develop efficient unicast, broadcast and parallel routing algorithms on locally connected hypercube networks.
本文基于局部连通性网络容错模型设计了高效的单播、广播和并行容错路由算法。
We develop efficient unicast, broadcast and parallel routing algorithms on locally connected hypercube networks.
应用推荐