-
sip_hmp_asr_tts_demo
带语音识别的SIP-HMP程序, 可以实现ASR和TTS(sip hmp asr tts demo)
- 2017-12-06 09:09:24下载
- 积分：1
-
chuanghanshu
这是整理的，在ASK通信中所需要的各种窗函数的部分源代码(This is the finishing, in the ASK communication needed in various parts of the source code window function)
- 2020-12-23 10:49:06下载
- 积分：1
-
实验一 图像颜色特征提取
图像颜色特征提取 颜色是彩色图像最重要的内容之一，被广泛用于图像检索中。但从图像中提取颜色特征时，很多算法都先要对图像进行量化处理。量化处理容易导致误检，并且产生的图像特征维数较高，不利于检索(qqwxcszcsefxzvczfeczx)
- 2018-04-20 08:49:51下载
- 积分：1
-
DDS开发板-点频9834(ok)
AD9834驱动 stm32 建议结合datasheet一起调试(AD9834 Driver STM32 Recommends Debugging Together with Datasheet)
- 2020-06-24 14:40:02下载
- 积分：1
-
C++调用易语言dll
实现在C++中调用易语言编译出来的dll(Implement the DLL compiled in C++)
- 2020-07-01 21:20:02下载
- 积分：1
-
28335看门狗程序
说明： TMS320F28335看门狗程序，防止DSP运行过程中程序跑飞(TMS320F28335 Watchdog Program to Prevent the Program from Running in the Process of DSP)
- 2020-06-17 20:00:02下载
- 积分：1
-
完整串口通信程序Vc++源代码
一个非常完整的川口通讯源程序，我费了很大功夫才把他找到。(a very complete source Kawaguchi communications, I spent a lot of time and energy only to find him.)
- 2020-11-21 14:29:37下载
- 积分：1
-
07_CpuTimer0
说明： DSP的CPU定时器控制LED源程序，实现循环显示(DSP-CPU timer control LED source to achieve circular display)
- 2011-03-28 20:30:25下载
- 积分：1
-
获取某一个进程cpu 占用率 示例源码
支持多核 支持 实时读取
- 2014-01-21下载
- 积分：1
-
zoj1094
zoj094
Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
(Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
)
- 2012-06-10 10:38:53下载
- 积分：1
