搜索资源列表
CS_OMP
- 压缩感知信号重建的正交匹配追赶算法（omp），与bp算法相比较有叫高的精度，但是付出了计算量的代价-Compressed sensing signal reconstruction algorithm Orthogonal matching catch (omp), compared with the bp algorithm are called high precision, but at a cost of computation
1111
- 在八个城市之间建造电视微波中继站，如图是可行线路，弧旁数字为费用。试建在哪个城市可实现连通每个城市且费用为最低。-Between the eight cities in the construction of TV microwave relay station, it is feasible to figure lines, beside the figure for the cost of arc. Try to build cities in which to achieve connec
PTIDR_FILE_COMPRESSION
- 为减少测试数据存储量,提出一种有效的新型测试数据压缩编码———PTIDR 编码,并构建了基于该编码的 压缩P解压缩方案1 PTIDR 编码能够取得比FDR ,EFDR , Alternating FDR 等编码更高的压缩率,其解码器也较简单、 易实现,且能有效地降低硬件开销1 与Selective Huffman , CDCR 编码相比,PTIDR 编码能够得到较高的压缩率面积 开销比1 特别地,在差分测试集中0 的概率满足p ≥017610 时,PTIDR 编码能取得比FDR 编码
cv3
- struct Edge { Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
cv4
- Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
cv6
- Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
taxi-program
- 能实现计费功能。车起步开始计费，首先显示起步价（本次设计起步费为7.00元）,车在行驶3 km以内，只收起步价7.00元。车行驶超过3 km后,每公里2元，车费依次累加。当总费用达到或超过40元时，每公里收费4元。当遇到红灯或客户需要停车等待时，则按时间计费，计费单价为每20S收费1元-Billing function can be realized. Start start charging car, the first show starting price (starting fee of
taxi12
- 能实现计费功能。车起步开始计费，首先显示起步价（本次设计起步费为7.00元）,车在行驶3 km以内，只收起步价7.00元。车行驶超过3 km后,每公里2元，车费依次累加。当总费用达到或超过40元时，每公里收费4元。当遇到红灯或客户需要停车等待时，则按时间计费，计费单价为每20S收费1元-Billing function can be realized. Start start charging car, the first show starting price (starting fee of
177-01527-1207_UPCORE_Flow_A4.pdf
- how to reduce cost and save cost
zlib
- windows下压缩解压函数的库，想提高网络传输性能的可以关注一下。-gzip lib under windows, very useful to reduce the network transfer cost.
Synthetic_Data_Generation
- A* uses a best-first search and finds a least-cost path from a given initial node to one goal node
fan4
- 若要在n个城市之间建设通信网络，只需要假设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。-To build a communication network between the n cities, only need to assume a n-1 lines can be. Construction communication network at the lowest economic cost of the minimum spanning tree o
mylzma.tar
- LZMA的小的lib库，可以用极小的代价/库实现LZMA的压缩，适宜于小的系统使用。 -LZMA small lib library, you can use a very small cost/library implements LZMA compression, suitable for small systems.
encoder
- 264编码过程中的宏块的编码和条带的编码，以及最后的率失真代价的计算-264 encoding process of encoding and coded slice macroblock, and the final calculation of the rate-distortion cost. . .