-
FaceCheck
基于EmguCV的人脸检测！！非常简单的一个程序，很容易看懂！基于EmguCV的人脸检测！！非常简单的一个程序，很容易看懂！(c# EmguCV Face detect
c# EmguCV Face detect
c# EmguCV Face detect)
- 2011-12-09 10:07:27下载
- 积分：1
-
迪杰斯特拉算法
迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的，因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。
- 2022-07-17 21:43:20下载
- 积分：1
-
srilm_vc2008
The SRI Language Modeling Toolkit contains a bunch of useful utilities for language modeling related research. The standard toolkit only includes build procedures for unix and Windows using Cygwin. I wanted to use the libraries in a Visual Studio project, so here is a solution and project files that builds native Windows libraries and the associated command-line utilities.
Instructions
* Download and unpack the SRILM toolkit.
* Unzip the below solution archive to the SRILM root directory.
* Load the srilm.sln in Visual Studio 2005.
* Select either Debug or Release in Build->Configuration Manager
* Right-click on each project in the libs folder, select Build.
* Build any of the command-line utilities you need.
- 2010-12-02 20:24:05下载
- 积分：1
-
Gabor-filer
基于opencv的Gabor滤波器。希望对大家有点帮助。(Opencv based on Gabor filters. We want a little help.)
- 2013-11-03 10:56:26下载
- 积分：1
-
aghorinhm
KRUSAL算法实现最小生成数的 最小生成数的 最小生成数的(The KRUSAL algorithm realizes the minimum generating number of the minimum generating numbe)
- 2018-08-03 20:10:02下载
- 积分：1
-
fdtd3d
3D FDTD algorithm realized in c++
- 2010-05-19 06:29:28下载
- 积分：1
-
火狐浏览器密码 Descrypter
使用系统;
使用 System.IO;
使用 System.Runtime.InteropServices;
使用 System.Data;
使用 SQLiteWrapper;
使用 System.Text;
DarkSelFFDecr 命名空间
- 2023-05-01 10:25:03下载
- 积分：1
-
A213855715-16866
实现窗口的任意停靠功能！其是用VC++6.0实现的！(Achieve window of arbitrary docked function! Its achieved with VC++6.0!)
- 2013-04-13 12:48:07下载
- 积分：1
-
pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
- 2015-01-15 22:31:59下载
- 积分：1
-
Vrp-All
VRP算法测试数据，包含测试数据和最优解，非常方便的数据(test- for- vrp)
- 2014-03-09 10:47:44下载
- 积分：1
|
联系客服（QQ：3324461878）
