this directory contains the following: * The acdc algorithm for finding the approximate general (non-orthogonal) joint diagonalizer (in the direct Least Squares sense) of a set of Hermitian matrices. [acdc.m] * The acdc algorithm for finding the same for a set of Symmetric matrices. [acdc_sym.m](note that for real-valued matrices the Hermitian and Symmetric cases are similar however, in such cases the Hermitian version [acdc.m], rather than the Symmetric version[acdc_sym] is preferable. * A function that finds an initial guess for acdc by applying hard-whitening followed by Cardoso s orthogonal joint diagonalizer. Note that acdc may also be called without an initial guess, in which case the initial guess is set by default to the identity matrix. The m-file includes the joint_diag function (by Cardoso) for performing the orthogonal part. [init4acdc.m]
標簽： approximate directory algorithm the
上傳時間： 2014-01-17
上傳用戶：hanli8870
embedded xLinux root 5.4
上傳時間： 2016-10-26
上傳用戶：huangld
Produce Java classes to calculate and display the root of a quadratic equation when input the coefficients a, b and c within the range of -100 to 100 by user.
標簽： calculate the quadratic equation
上傳時間： 2014-01-17
上傳用戶：aappkkee
利用MATLAB實現求根root-music算法的DOA估計的仿真
標簽： root-music MATLAB DOA 算法
上傳時間： 2016-11-08
上傳用戶：dengzb84
第三章 MATLAB 圖形對象 3.1 圖形對象 3.1.1 Root 對象 3.1.2 Figure 對象 3.1.3 Uicontrol 對象 3.1.4 Uimenu 對象 3.1.5 Axes 對象 3.1.6 Image 對象 3.1.7 Line 對象 3.1.8 Patch 對象 3.1.9 Rectangle 對象 3.1.10 Surface 對象 3.1.11 Light 對象 3.1.12 Text 對象
標簽： 對象 Uicontrol MATLAB Figure
上傳時間： 2013-12-22
上傳用戶：saharawalker
root啟動程序,是atmel例子,已經運行
上傳時間： 2016-12-03
上傳用戶：電子世界
Ant colony optimization for finding the global minimum
標簽： optimization finding minimum colony
上傳時間： 2016-12-15
上傳用戶：guanliya
Modify the Gray-coded modulation example (COMMDOC_GRAY) so that it uses a pair of square root raised cosine filters to perform pulse shaping and matched filtering at the transmitter and receiver, respectively.
標簽： COMMDOC_GRAY Gray-coded modulation example
上傳時間： 2017-01-08
上傳用戶：zhangzhenyu
A tutorial and open source code for finding edges and corners based on the filters used in primary visual cortex.
標簽： and tutorial finding corners
上傳時間： 2013-12-24
上傳用戶：qb1993225
Instead of finding the longest common subsequence, let us try to determine the length of the LCS. Then tracking back to find the LCS. Consider a1a2…am and b1b2…bn. Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
標簽： the subsequence determine Instead
上傳時間： 2013-12-17
上傳用戶：evil
