Location:
Search - complexity
Search list
Description: Complexity and Cryptography An Introduction-Complexity and Cryptography An Introduct ion
Platform: |
Size: 1172657 |
Author: mp |
Hits:
Description: 《算法和复杂度》（英文版）-"algorithms and complexity" (English version)
Platform: |
Size: 935539 |
Author: 杨涛 |
Hits:
Description: Low-Feedback-Rate and Low-Complexity Downlink Multiuser MIMO Systems
Platform: |
Size: 526675 |
Author: 252364193@qq.com |
Hits:
Description: 《算法和复杂度》（英文版）-"algorithms and complexity" (English version)
Platform: |
Size: 934912 |
Author: 杨涛 |
Hits:
Description: VC＋＋编程实现了二元域的BM算法。Berlekamp-Massey 算法是一个少有的高效算法。只需要输入密文中的2l个比特，就可以产生LFSR的最小多项式，从而生成整个序列。这里的l是系统的线性复杂度。-VC++ programming domain of the dual BM algorithm. Berlekamp-Massey algorithm is a rare efficient algorithm. Just type of dense text 2l bits, we can have the minimal polynomial LFSR, resulting in the formation of the entire sequence. Here l is the linear complexity.
Platform: |
Size: 1911808 |
Author: 赖晖 |
Hits:
Description: 采用能量门限的语音活动端点检测程序，计算复杂度低．-using energy threshold voice activities endpoint detection procedures, low computational complexity.
Platform: |
Size: 1024 |
Author: tamato |
Hits:
Description: Kruskal算法，Kruskal算法的时间复杂度为 ，与图中边数有关，而与图中的顶点数无关，因此该算法适合与求边稀疏的网的最小生成树。-Kruskal algorithm, the algorithm Kruskal time complexity of, and chart the edge, with map unrelated to the number of vertices, and the algorithm for edge for the sparse network of minimum spanning tree.
Platform: |
Size: 6144 |
Author: gdfgdfg |
Hits:
Description: Complexity and Cryptography An Introduction-Complexity and Cryptography An Introduct ion
Platform: |
Size: 1172480 |
Author: mp |
Hits:
Description: 针对小波变换和多级树集合分裂图像编码具有浮点数运算、算法复杂等特点,采用整数实现的提升格式代替了原来的小
波变换,并结合提升小波变换和DCT变换的特点,提出了一种改进方案。-For wavelet transform and multi-level set to split the tree image coding with floating-point computation, algorithmic complexity, etc., realize the upgrading of the use of integer format instead of the original wavelet transform, combined with lifting wavelet transform and DCT transform, an improved program.
Platform: |
Size: 287744 |
Author: jingjing |
Hits:
Description: 低复杂度下基于mmse的turbo均衡，降低了算法的计算复杂度-Low Complexity MMSE-based balance of the turbo, reducing the algorithm computational complexity
Platform: |
Size: 2048 |
Author: 攻讦 |
Hits:
Description: This module contains a high-performance HE-AAC decoder for 32-bit fixed-point
processors. The following is a summary of what is and is not supported:
Supported:
- MPEG2, MPEG4 low complexity decoding (intensity stereo, M-S, TNS, PNS)
- spectral band replication (SBR), high-quality mode
- mono, stereo, and multichannel modes
- ADTS, ADIF, and raw data block file formats
-This module contains a high-performance HE-AAC decoder for 32-bit fixed-point
processors. The following is a summary of what is and is not supported:
Supported:
- MPEG2, MPEG4 low complexity decoding (intensity stereo, M-S, TNS, PNS)
- spectral band replication (SBR), high-quality mode
- mono, stereo, and multichannel modes
- ADTS, ADIF, and raw data block file formats
Platform: |
Size: 668672 |
Author: gloryn |
Hits:
Description: The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order -The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order
Platform: |
Size: 1031168 |
Author: kedle |
Hits:
Description: RSA算法的实验报告，有源码、流程图、时间复杂度分析等。-RSA algorithm experimental reports, source code, flowcharts, time complexity analysis.
Platform: |
Size: 59392 |
Author: caixu |
Hits:
Description: Optimisation of the pilot-to-data power ratio in the wireless MIMO-OFDM
system with low-complexity MMSE channel estimation-Optimisation of the pilot-to-data power ratio in the wireless MIMO-OFDMsystem with low-complexity MMSE channel estimation
Platform: |
Size: 608256 |
Author: 何灵 |
Hits:
Description: 四种不同的算法在实现多项式相乘时的时间复杂度比较-Four different algorithms, when multiplied in the realization of polynomial time complexity comparison
Platform: |
Size: 1024 |
Author: alexandar |
Hits:
Description: 基于复杂度的睡眠脑电动力学分析 C语言实现-Based on the complexity of dynamic analysis of sleep EEG C language
Platform: |
Size: 2048 |
Author: 赵玥辰 |
Hits:
Description: 这本书是关于算法和复杂性，因此它在解决问题的方法上 计算机和费用（通常是运行时间），使用这些方法。
计算需要时间。有些问题需要很长的时间其他人就可以迅速完成。一些问题 似乎需要很长时间，然后有人发现一个更快的方法，研究的数额计算端口的是需要的，以便执行某些类型的计算是研究计算复杂性的关键。-This book is on algorithms and complexity, it solve the problem in the computer and the cost (usually run time), the use of these methods. Calculation will take time. Some problems take a long time to others can be completed quickly. Some of the problems seem to take a long time, and then someone discovered a faster way to study the amount of ports is necessary for the implementation of certain types of calculation is to examine the computational complexity of the key.
Platform: |
Size: 1359872 |
Author: 韩雪莲 |
Hits:
Description: It is for complexity measure methods
good for nonlinear dynamics
Platform: |
Size: 34816 |
Author: sunghoon |
Hits:
Description: "A Low Complexity Algorithm for Proportional Resource Allocation in OFDMA Systems"关于子载波和功率分配的代码，对应这篇文章，大家共同学习。希望大家提供的源码带上原文，以便研究。-" A Low Complexity Algorithm for Proportional Resource Allocation in OFDMA Systems" With regard to the allocation of subcarriers and power of the code, corresponding to this article, we learn together. Hope that we provided to bring the original source in order to study.
Platform: |
Size: 165888 |
Author: 赵子顾 |
Hits:
Description: reduced complexity parameter estimation in mimo ofdm
Platform: |
Size: 1024 |
Author: murali |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»