搜索资源列表
TV.tar
- TV-tree的c实现源码，对应原文章K.-I. Lin, H. V. Jagadish, C. Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data.-TV-tree c achieve the source, the original corresponding article K.-I. Lin, H. V. Jagadish, C. Faloutsos : The TV-Tree : An Index S
IrCOMM2kQuellen
- IrCOMM2k - Virtual Infrared COM Port for Windows 2000/XP。 2. FILES IN THIS ARCHIVE: - Setup.exe (setup and uninstall program) - ircomm2k.exe (service program) - ircomm2k.sys (device driver) - ircomm2k.dll (device property page) -
intel2gas-1.3.3.tar
- linux 下 intel 转 K&R 汇编语言格式的工具, 对于k&r格式不是特别熟悉的话, 用这个工具很好.-intel under linux to K & R tool assembly language format, for the k & r is not particularly familiar with the format, using the tools well.
R-Opt-Lin-Kernighan
- Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.
c11_teqtutor
- . R. Johnson, Jr., R. K. Martin, J. M. Walsh, A. G. Klein, C. E. Orlicki, and T. Lin, "Blind Channel Shorteners," Proc. The 13th IFAC Symposium on System Identification, Rotterdam, The Netherlands, August 2003.
Linear_and_Nonlinear_Diffusions
- Jd=diffusion(J,method,N,K) J :待扩散的原图像 method : lin : 线性扩散 (常数 c=1). pm1 : perona-malik, c=exp{-(|grad(J)|/K)^2} pm2 : perona-malik, c=1/{1+(|grad(J)|/K)^2} rmp : 复数 K :边缘门限参数 N :迭代次数 dt:时间步长 (0 < dt <= 0.25, 缺省值为0.2)
Binary-Tree
- Cay nhị phan bằ ng danh sách liên kế t-Cay nhị phan bằ ng danh sách liên kế t
dastebandi
- Design a feedforward network is u dehaze algorithms review path planning using GA and ACO... The neural network adaboost stron TS neural network m files, fast c bp neural network, written with C Bayes net and memory based learni
estekhraj-vijegi
- Design a feedforward network is u dehaze algorithms review path planning using GA and ACO... The neural network adaboost stron TS neural network m files, fast c bp neural network, written with C Bayes net and memory based learni
jiancezhixian
- 为了能有效解决H ough 变换的计算量大的问题，文中提出了一种基于直线局部结构特征的H ough 变换改进的直 线检测算法。该算法根据F reem an 准则分析了直线上基元的特征信息，通过图像上邻近的同类基元的倾斜角约束基元上 像素点的极角范围，减少每个点的计算次数，在保持精度的同时，提高直线检测的速度，在有噪声的情况下，该算法相对标 准H ough 变换算法可以提高到6 到7 倍。 -In o rder to effectively solve the pro blem o
LKH-2.0.2
- K Helsgaun s Lin-kernighan heuristic implementation for traveling salesman problems, one of the best TSP solver. Pure C implementation.
CANoe KLIN
- 该文档描述如何在CANoe中使用K-LIN进行诊断，帮助汽车工程师快速入门(K LIN access in CANoe, helpful for the vehicle engineers)
Kernighan-Lin算法对空手道俱乐部优化
- 本程序利用K-L算法对空手道俱乐部网络模型进行划分(Using K-L algorithm to divide karate clubs)