-
-
FastWalshHadamardTransform.rar
... can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2. ...
-
boundsonLDPCandLDGM.zip
... holds for standard irregular ensembles when used over
binary input output symmetric channels.
The method is first developed for Tanner graph ensembles with Poisson left degree distribution.
It is then generalized to ‘multi-Poisson’ graphs, and, by a ...
-
prim.rar
Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree ...
-
-
-
-
000cad3d.zip
an useful tool for draw some graph style, such as line, rectangle.
-
-
-
segmentation.rar
... obtained a local measure
of how likely two nearby pixels are to belong to the same region, we use the spectral graph theoretic framework of
normalized cuts to find partitions of the image into regions of coherent texture and brightness. Experimental ...
-
Go To English Version 超过100万源码资源，1000万源码文件免费下载
