搜索资源列表
2(2)
- 最小生成树之Prim算法 Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O(n^2) Prim算法实现： （1）集合：设置一个
Compilingpnciplecoursedesign
- NFA的确定化是指对给定的NFA都能相应地构造出一个与之等价的DFA，使它们能够识别相同的语言。NFA的确定化使状态转移的复杂度仅为O(1)，为状态的转移提供了帮助。-Make the NFA refers to the NFA accordingly given to construct a and the equivalent DFA, enables them to identify the same language. Make
yixuetuxiangfenge
- 出了一种适合医学图像分割的改进分水岭算法，针对分水岭算法存在的过分割问题，采用数学 形态学重构滤波器和Ostu阈值分割方法对图像中感兴趣的目标和背景进行标记。根据标记的二值图像， 运用形态学极小值标定技术对原有梯度图像进行修正。最后，使用分水岭算法对修正的梯度图像进行分割。该方法能有效抑制过分割现象，而且计算复杂程度较低、分割效果较好。-Out of a medical image segmentation for improv
Clustering_Coefficient
- 根据邻接矩阵，计算复杂网络中模块的聚类系数。-According to the adjacency matrix, the computational complexity of the network module clustering coefficients.
1
- 完成将N随机输入的n个结点（含x，y坐标）的快速排雷，实现n个结点相连之后路径长度最短。实现的过程中，占用内存小，时间复杂度和空间复杂度小。-Completion of the N random input n nodes (including x, y coordinates) of the rapid clearance, achieved after n nodes connected to the shortest path l
TPC
- 文章详细介绍了TPC编码技术及信道容限， 是一篇不错的介绍TPC的文章-An important goal for a new communication system is to transfer information at a high rate while keeping energy consumption low. Shannon s channel capacity sets a limit on the tradeo
voronoi
- Voronoi图的分治算法，达到O（nlogn）的时间复杂度。-Voronoi diagram of the divide and conquer algorithm to achieve O (nlogn) time complexity.
hafubianhuan
- 哈夫变换直线参数检测是图像分析和计算机视觉中一个基本问题,哈夫变换能很好地解决这个问题,然而哈夫变换的巨大计算量使它难于实时应用.因为一个图像点对应参数空间的一条曲线,图像点与量化后的参数区间是一对多的关系,造成了标准哈夫变换的计算复杂性.而两点确定一条直线,两个图像点对应一个参数点,利用这个原理能大幅度减少哈夫变换的计算量. -Hough transform line detection is a parameter image
simwer
- Firewall policies can contain several thousand rules due to the large size and complex structure of modern networks. The size and complexity of these policies require automated tools providing a user-friendly environment
datachangebaseondialog
- 模态对话框与应用程序之间的数据交换,可以供初学者进行学习，也为需要使用数据交换的复杂程序提供基本框架。-Modal dialog and exchange of data between applications can be for beginners to learn, but also the complexity of data exchange required to provide a basic fr a mework.
Constraint-Based-Verification
- 系統化驗証方法及實例探討Assertion, Constraint synthesis-Electronic Design complexity getting higher, the verification work needs to be fully understood
sorted_array
- Write a short recursive Java method that finds the minimum and maximum values in an array of integer values without using any loops. Also write its recurrence relation (recurrent complexity formula).
mobilecommunication
- In this paper the reduction of Intersymbol Interference (1 ) in mobile communication channels is addressed. A well known technique for IS1 reduction is adaptive equalization in which the time-varying characteristic
T-REC-G.719-200806-I!!SOFT-ZST-E
- 高质量对话应用的低复杂度全频段音频编码 To be published、带软件、预发布文件-Low-complexity full-band audio coding for high-quality conversational applications
PulsedOFDM
- In this paper, we describe a novel approach for reducing the power consumption and complexity of a multiband orthogonal frequency-division multiplexing (MB-OFDM) ultrawideband (UWB) system by applying ideas from pulsed U
pofdmft
- A multi-band orthogonal frequency division multiplexing (OFDM) ultra wideband (UWB) system is being considered for the IEEE 802.15.3a wireless personal area networks. An enhancement to this system, named pulsed-OFDM,
Tarik
- A suitable algorithm suggested with wavelet compression for gray scale images based on e- and two-dimension combined hierarchical structure, in the sub-band which has been generated by the aid of several types of wav
work
- 对于细胞图像序列中多目标的追踪是细胞运动研究中的难点，针对高密度细胞图像中细胞运动的复杂性，本文提出一个细胞分割和追踪的系统。在细胞分割部分，针对实验所用细胞图像序列的特点，本文分别采用了不同的分割方法。在基本的细胞分割后，由于得到的分割图像存在着一些粘连细胞，为了将之分离，采用了基于Freeman code法对细胞轮廓进行跟踪编码。根据编码所得的链码特征分析细胞的轮廓形态，找出粘连细胞图像中的凹角点，再将凹角点进行分组配对完成粘连细胞
Debug
- 将顺序表重新排列成以第一个元素为界的两部分，前一部分元素的值都小于它，后一部分元素的值都大于或等于它。估算所设计算法的时间复杂度和空间复杂度-Will be re-arranged in the order form the first element is bounded by the two parts, the first part of the element values are less than it, and the l
a
- 将顺序表重新排列成以第一个元素为界的两部分，前一部分元素的值都小于它，后一部分元素的值都大于或等于它。估算所设计算法的时间复杂度和空间复杂度-Will be re-arranged in the order form the first element is bounded by the two parts, the first part of the element values are less than it, and the l