Sort by
  1. Language:PDF
  2. Category:Algorithm
  3. Time:ALL
  4. View:500—1000 times
Remove all
Language More Hide
Category More Hide
Time
View
More

OFDM/OQAM's paper(OFDM/OQAM论文)

size:16px;">这一部分是关于OFDM/OQAM的论文的一个合集,其中以classic OFDM Systems and Pulse Shaping OFDM/OQAM Systems为中心,将其中论文涉及的参考文献都几乎都下载了下来,而且对应的引用的编号和标题有对应,可以很好的查看论文。这些...

Fast Algorithms for Projected Clustering

a traditional subspace clustering algorithm for high dimensional data...

Finite element method and application of Principle 2 (Zhu Bofang) is the finite

Finite element method and application of Principle 2 (Zhu Bofang) is the finite element books more classic one, including the bar, flat, space modules and application of the principles involved in fluid mechanics, heat conduction, concrete creep, elastic stability, large displacement, fracture, etc....

Statistical and Adaptive Signal Processing Spectral Estimation, Signal Modeling, Adaptive Filtering, and Array Processing

This book is an introduction to the theory and algorithms used for the analysis and processing of random signals and their applications to real-world problems. The fundamental characteristic of random signals is captured in the following statement: Although random signals are evolving in time in an...

DC motor speed and position control

time DC motor speed and position control for learning purpose using operational amplifier as an analog PID controller. A PID controller is designed using MATLAB as a simulation tool to determine a set of coefficients that meet the performance requirement of dc motor. The controller coefficients...

Clustering through Decision Tree Construction

CLTree - A subspace clustering algorithm.-Clustering through Decision Tree Construction- CLTree- A subspace clustering algorithm....

Algorithms, Initializations, and Convergence for the Nonnegative Matrix Factorization

space:nowrap;">它是知名好初始化可以改善的速度和准确性的解决方案 许多非负矩阵分解 (NMF) 算法 [56]。许多 NMF 算法很敏感 在 W 或 H 或两者的初始化。这是尤其如此的算法 包括这两个新的 ALS 算法,我们目前的交替最小二乘法 ...

apriori Algorithm

size:16px;">Apriori 算法是一种有影响力的算法为布尔型关联规则的挖掘频繁项集。关键概念:• 频繁项集: 项目具有最低的集支持 (由李为第 i 个集表示)。• 先天属性: 频繁项集的任何子集必须频繁。• 加入操作: 要找到路...


LOGIN

Don't have an account? Register now
Need any help?
Mail to: support@codeforge.com

切换到中文版?

CodeForge Chinese Version
CodeForge English Version

Where are you going?

^_^"Oops ...

Sorry!This guy is mysterious, its blog hasn't been opened, try another, please!
OK

Warm tip!

CodeForge to FavoriteFavorite by Ctrl+D