搜索:graph+algorithm
找到约 1,358 项符合「graph+algorithm」的查询结果
结果 1,358
按分类筛选
- 全部
- 技术资料 (182)
- matlab例程 (181)
- 人工智能/神经网络 (130)
- 数学计算 (89)
- 加密解密 (77)
- 数值算法/人工智能 (70)
- 其他 (70)
- 数据结构 (48)
- 压缩解压 (39)
- 其他书籍 (35)
- Java编程 (34)
- 通讯/手机编程 (22)
- 书籍源码 (22)
- 软件设计/软件工程 (22)
- Linux/Unix编程 (20)
- 通讯编程文档 (17)
- 文章/文档 (17)
- 文件格式 (16)
- VHDL/FPGA/Verilog (14)
- 技术管理 (11)
- 单片机开发 (11)
- DSP编程 (10)
- 电子书籍 (10)
- 系统设计方案 (10)
- VC书籍 (10)
- 软件工程 (9)
- 单片机编程 (8)
- 汇编语言 (8)
- 行业发展研究 (8)
- 书籍 (8)
- JavaScript (7)
- 其他嵌入式/单片机内容 (6)
- 论文 (6)
- 多媒体处理 (5)
- 操作系统开发 (5)
- 驱动编程 (5)
- CA认证 (5)
- 嵌入式/单片机编程 (5)
- 源码 (5)
- 编辑器/阅读器 (4)
- 编译器/解释器 (4)
- 多国语言处理 (4)
- STL (4)
- GPS编程 (4)
- 学术论文 (3)
- 通信网络 (3)
- 教程资料 (3)
- 可编程逻辑 (3)
- Applet (3)
- 其他数据库 (3)
- Delphi控件源码 (3)
- 其他行业 (3)
- 中间件编程 (3)
- 并行计算 (3)
- VIP专区 (3)
- 数据库系统 (2)
- Matlab (2)
- 嵌入式综合 (2)
- 教育系统应用 (2)
- Modem编程 (2)
- 游戏 (2)
- 磁盘编程 (2)
- *行业应用 (2)
- 网络 (2)
- 微处理器开发 (2)
- J2ME (2)
- 生物技术 (2)
- C/C++语言编程 (1)
- 行业应用文档 (1)
- 无线通信 (1)
- 接口技术 (1)
- Linux/uClinux/Unix编程 (1)
- 设计相关 (1)
- 图形图像 (1)
- 技术书籍 (1)
- 测试测量 (1)
- 实用工具 (1)
- Internet/网络编程 (1)
- 语音压缩 (1)
- 企业管理 (1)
- Java书籍 (1)
- 家庭/个人应用 (1)
- Windows CE (1)
- SQL Server (1)
- Jsp/Servlet (1)
- RFID编程 (1)
- MTK (1)
- 3G开发 (1)
- 能源行业(电力石油煤炭) (1)
- 精品软件 (1)
- 习题答案 (1)
https://www.eeworm.com/dl/617/248202.html
压缩解压
Code to run the Non-negative Matrix Factorization algorithm as presented in the Lee, Seung 1999 Natu
Code to run the Non-negative Matrix Factorization algorithm as presented in the Lee, Seung 1999 Nature paper.
https://www.eeworm.com/dl/534/256376.html
其他
主要是KNN(the k-nearest neighbor algorithm ),LVQ1(learning vector quantization 1), DSM(decision surface
主要是KNN(the k-nearest neighbor algorithm ),LVQ1(learning vector quantization 1), DSM(decision surface mapping)算法。
and a simple clustering algorithm.
https://www.eeworm.com/dl/665/178584.html
matlab例程
the program is based on LMS filter algorithm,and it has been simulated,the simulation environment is
the program is based on LMS filter algorithm,and it has been simulated,the simulation environment is matlab
https://www.eeworm.com/dl/627/155094.html
语音压缩
Intel/DVI ADPCM coder/decoder. The algorithm for this coder was taken from the IMA Compatability Pr
Intel/DVI ADPCM coder/decoder.
The algorithm for this coder was taken from the IMA Compatability Project
proceedings
https://www.eeworm.com/dl/665/216492.html
matlab例程
New matching pursuit-based algorithm for SNR improvement in ultrasonic NDT (signal process 中的文章
New matching pursuit-based algorithm for SNR improvement in ultrasonic NDT
(signal process 中的文章,mp去噪)
https://www.eeworm.com/dl/619/171810.html
Linux/Unix编程
The Viterbi algorithm is the same as the binary case with one main difference: The survivor sequence
The Viterbi algorithm is the same as the binary case with one main difference: The survivor sequences include the uncoded bits, which are decided at each trellis stage when selecting one of two parallel branches with the largest correlation metric.
Presently, only 8-PSK modulat ...
https://www.eeworm.com/dl/519/206918.html
加密解密
Tiger Tree Hash is constructed from two parts, the Tiger Hash Algorithm and Merkle Tree. The origina
Tiger Tree Hash is constructed from two parts, the Tiger Hash Algorithm and Merkle Tree. The original Tiger Hash code was taken from Tiger.Net which is written in Visual Basic. NET.
Tiger Tree Hash算法的C#实现!
https://www.eeworm.com/dl/650/200938.html
人工智能/神经网络
This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your pr
This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap class I made to sort the score values.
https://www.eeworm.com/dl/658/187942.html
STL
implement huffman algorithm with stl priority-queue, first you must have the file, then the result i
implement huffman algorithm with stl priority-queue, first you must have the file, then the result is saved
https://www.eeworm.com/dl/650/343494.html
人工智能/神经网络
he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood form
he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization.
The number of independent components a ...