Location:
Search - Kolmogorov
Search list
Description: 关于非线性时间序列中同时计算关联维和Kolmogorov熵的程序,-on nonlinear time series simultaneously calculate the correlation dimension and Kolmogorov entropy procedures,
Platform: |
Size: 32051 |
Author: gxsh |
Hits:
Description: 同时计算关联维和Kolmogorov熵的C++源代码
Platform: |
Size: 32049 |
Author: 戴志 |
Hits:
Description: 网络流量的kolmogorov参数,简要说明了kolmogorov参数的作用及国外的研究
Platform: |
Size: 34108 |
Author: 连林 |
Hits:
Description: 关于非线性时间序列中同时计算关联维和Kolmogorov熵的程序,-on nonlinear time series simultaneously calculate the correlation dimension and Kolmogorov entropy procedures,
Platform: |
Size: 31744 |
Author: gxsh |
Hits:
Description: 神经网络训练根据Kolmogorov定理，输入层有14个节点，所以中间层有29个节点
％中间层神经元的传递函数为 tansig
％输出层有8个节点，其神经元传递函数为logsig
％训练函数采用traingdx-neural network training under the Kolmogorov theorem, input layer has 14 nodes, Therefore, the intermediate layer has 29% of nodes middle layer neurons in the transfer function for the output layer tansig% have eight nodes, its neuron transfer function for the training function logsig% used traingdx
Platform: |
Size: 1024 |
Author: 陈胜 |
Hits:
Description: 同时计算关联维和Kolmogorov熵的C++源代码-At the same time calculation of correlation dimension and Kolmogorov entropy of the C++ Source code
Platform: |
Size: 31744 |
Author: 戴志 |
Hits:
Description: 关于混沌Kolmogorov熵的计算程序，在前人基础上自己编写的。已经用过很多混沌时间序列K熵的计算。-On chaotic Kolmogorov entropy calculation procedure, based on predecessors have written. Has been used a lot of chaotic time series K entropy calculations.
Platform: |
Size: 3072 |
Author: 张真 |
Hits:
Description: The two algorithms are max-product belief propagation (BP, Pearl 88) and
sequential tree-reweighted max-product message passing (TRW-S, Kolmogorov 05)
Platform: |
Size: 39936 |
Author: wdbigboy |
Hits:
Description: Kolmogorov 熵的计算 - GP算法-Kolmogorov entropy calculation- GP Algorithm
Platform: |
Size: 9216 |
Author: 陆振波 |
Hits:
Description: Kolmogorov 熵的计算 - STB算法
-Kolmogorov entropy calculation- STB algorithm
Platform: |
Size: 5120 |
Author: 陆振波 |
Hits:
Description: 网络流量的kolmogorov参数,简要说明了kolmogorov参数的作用及国外的研究-Kolmogorov network traffic parameters, a brief description of the role of the Kolmogorov parameter and study abroad
Platform: |
Size: 33792 |
Author: 连林 |
Hits:
Description: 对Vladimir Kolmogorov，Yuri Boykov大牛的算法杰作——Graph Cut进行使用演示，代码力求精简，可供Graph Cut初学者参考学习。已通过VS2005编译。-Of Vladimir Kolmogorov, Yuri Boykov big cow masterpiece algorithm- Graph Cut for the use of demonstration, the code to be simple, for beginners Reference Graph Cut Study. VS2005 compiler has passed.
Platform: |
Size: 17408 |
Author: 杨金名 |
Hits:
Description: 求K熵(Kolmogorov Entropy)
GP算法 - \KolmogorovEntropy_GP\Main_KolmogorovEntropy_GP.m
STB算法 - \KolmogorovEntropy_STB\Main_KolmogorovEntropy_STB.m-For K-entropy (Kolmogorov Entropy) GP algorithm- \ KolmogorovEntropy_GP \ Main_KolmogorovEntropy_GP.m STB algorithm- \ KolmogorovEntropy_STB \ Main_KolmogorovEntropy_STB.m
Platform: |
Size: 5120 |
Author: chenchen |
Hits:
Description: This function performs the one sample, two tailed Kolmogorov-Smirnov hypothesis
test on a set of data samples for a given cumulative distribution function.
Platform: |
Size: 1024 |
Author: xie |
Hits:
Description: ApEn(近似熵)方法是测度熵的一种替代算
法,简单可靠,值得深入研究.
-.The correlation dimension obtained from this
method is optimal and the stable estimation of the Kolmogorov entropy is also obtained.
Platform: |
Size: 101376 |
Author: k |
Hits:
Description: 1928年, George D. Birkhoff提出了著名的美学度量公式measure = order/complexity.但是order和complexity具体如何计算并没有给出。本文在Shannon信息论的基础上，提出了基于Shannon entropy和kolmogorov complexity的美学度量。作者认为他们“on a promising track with a sound theoretical basis, which not only extends but will further develop Birkhoff’s and Bense’s aesthetics studies”(同意，呵呵)。论文中利用到的信息论基本概念有：Shannon Entropy, conditional entropy, mutual information, Jensen-Shannon inequality, kolmogorov complexity和physical entropy等。-In 1928, George D. Birkhoff aesthetic measure proposed by the famous formula of measure = order/complexity. But the order and complexity did not give specific how to calculate. In this paper, based on Shannon information theory, was proposed based on Shannon entropy and kolmogorov complexity of the aesthetic measure. Author believes that they are " on a promising track with a sound theoretical basis, which not only extends but will further develop Birkhoff' s and Bense' s aesthetics studies" (agree, huh, huh). Use of papers to the basic concept of information theory: Shannon Entropy, conditional entropy, mutual information, Jensen-Shannon inequality, kolmogorov complexity and physical entropy and so on.
Platform: |
Size: 3140608 |
Author: zeng pingping |
Hits:
Description: 一种对于图匹配优化问题对偶分解的算法实现-An implementation of a dual decomposition technique for the graph matching optimization problem described in
Feature Correspondence via Graph Matching: Models and Global Optimization.
Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother.
In European Conference on Computer Vision (ECCV), October 2008.
Platform: |
Size: 48128 |
Author: illusionme |
Hits:
Description: Yuri Boykov s and Vladimir Kolmogorov s work on graph cuts and MRF optimization has been extensively cited in the academia, and their maximum flow implementation is widely used in computer vision and image processing research.
Platform: |
Size: 139264 |
Author: utrade1 |
Hits:
Description: 计算信号的Kolmogorov熵, 计算信号的Kolmogorov熵,计算信号的Kolmogorov熵-computing Kolmogorov entropy of signal
Platform: |
Size: 2048 |
Author: zsqjc |
Hits:
Description: Kolmogorov is a evolutionary method
Platform: |
Size: 1024 |
Author: Prasenjit Dey |
Hits: