资源列表
DecHex7Seg
- Decoder Hex 7 Segments - VHDL Project
代码
- 静态背景 ，显著目标提取，帧间差分法，背景差分法，运动目标提取(Moving object extraction)
GMT之路-1.0
- 适合GMT入门者参考，让初学者了解GMT软件的初步应用，深入浅出地介绍了GMT软件的应用。(For beginners GMT reference for beginners to understand the application of GMT software, introduced the application of GMT software.)
SMR
- 替换矩阵源代码，基于分类的加权稀疏表示方法(Substitution Matrix Representation source code)
新建文件夹
- 输入硬币的图片，设计处理策略并编写程序，由程序自动算出图像中的硬币个数。(Enter pictures of coins, output coins)
libbase58-master
- Initialisation -------------- Before you can use libbase58 for base58check, you must provide a SHA256 function. The required function signature is: bool my_sha256(void *digest, const void *data, size_t datasz) Simply assign your function to b
bips-master
- People wishing to submit BIPs, first should propose their idea or document to the mailing list. After discussion they should email Luke Dashjr <luke_bipeditor@dashjr.org>. After copy-editing and acceptance, it will be published here. We are
libblkmaker-master
- Also note that you should NOT roll ntime for data retrieved without explicitly checking that it falls within the template's limitations (mintime, maxtime, mintimeoff, and maxtimeoff); read the BIP 23 specification in detail to understand how they
dash-master
- What is Dash? Dash is an experimental new digital currency that enables anonymous, instant payments to anyone, anywhere in the world. Dash uses peer-to-peer technology to operate with no central authority: managing transactions and issuing money a
MessageParseTool
- 解析终端上报的报文 包括了报文整理转义解压缩等算法(Parsing terminal reported packets, including packet collation, escape, decompression and other algorithms)
bitcoin-master
- What is Bitcoin? Bitcoin is an experimental digital currency that enables instant payments to anyone, anywhere in the world. Bitcoin uses peer-to-peer technology to operate with no central authority: managing transactions and issuing money are car
4981a68afa330ba1175e0527f16fa799
- Dijkstra 这种算法的发展比较成熟，适用性也较为广泛，能够求出连通的网络图 中任何两点间的静态最短路径，是路径优化理论的基础，但是，在时变的交通信息里， 静态意义上算出的最短路径并不是其真正的最短路径，并且， Dijkstra 这种算法的关 键是按照节点与起点距离递增的顺序，产生最短距离的过程，这个过程的计算很麻烦。 由于它只考虑了抽象网络的拓扑特性，(Dijkstra The development of this algorithm is more mature,