-
AD7705 and the use of thermistor to detect the actual temperature
利用AD7705与热敏电阻来检测实际的温度-AD7705 and the use of thermistor to detect the actual temperature
- 2023-07-13 19:05:04下载
- 积分:1
-
小波变换,实现图像压缩,不错的东西大家下来,
小波变换,实现图像压缩,不错的东西大家下来,-Wavelet transform, to achieve image compression
- 2022-11-04 08:15:03下载
- 积分:1
-
finite state machine design and realization of the source code. Zip
有限状态机设计与实现源代码.zip-finite state machine design and realization of the source code. Zip
- 2022-02-24 15:44:16下载
- 积分:1
-
Free Software Foundation Inc.公司用java写的jpeg解码器。一个优秀的图像解码器面向对象模型。...
Free Software Foundation Inc.公司用java写的jpeg解码器。一个优秀的图像解码器面向对象模型。-Free Software Foundation Inc.. Companies using java write j peg decoder. An excellent image decoder object-oriented model.
- 2022-02-05 22:08:37下载
- 积分:1
-
fractal image compression source code, achieving Fractal iterative algorithm, Fr...
分形图像压缩源代码,实现了分形迭代算法,实现图像分形压缩,非常适合学习研究分形算法。-fractal image compression source code, achieving Fractal iterative algorithm, Fractal Image Compression, very suitable for studying the fractal algorithm.
- 2023-06-14 22:55:03下载
- 积分:1
-
哈夫曼算法以及哈夫曼树实现 c++实现 这个是编码的基础
哈夫曼算法以及哈夫曼树实现 c++实现 这个是编码的基础-Huffman Huffman tree algorithm and realize c++ Realize this is the basis of coding
- 2022-03-05 18:29:04下载
- 积分:1
-
Compressive Sensing The Big Picture
Compressive Sensing The Big Picture
可以连接到Rice大学等很多网页-Compressive Sensing The Big Picture
- 2023-02-03 07:55:03下载
- 积分:1
-
图像压缩的几个MATLAB算法:分块编码、高斯金字塔、离散余弦变换、单值分解。...
图像压缩的几个MATLAB算法:分块编码、高斯金字塔、离散余弦变换、单值分解。-Image Compression Algorithm several MATLAB : Block Coding, Gaussian pyramid, discrete cosine transform, singular value decomposition.
- 2022-02-03 23:09:40下载
- 积分:1
-
这是Struts2的jar包的jar文件Struts2
struts2 jar包 这是struts2的jar文件-This is struts2 jar package jar file of struts2
- 2022-08-04 01:24:25下载
- 积分:1
-
0_1背包问题使用一个给定n种去的动态规划解法…
0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?
在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。因此,该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.
- 2023-04-12 03:25:02下载
- 积分:1