代码搜索:decreasing

找到约 153 项符合「decreasing」的源代码

代码结果 153
www.eeworm.com/read/136989/5838937

decreasing-rates

75 50 25
www.eeworm.com/read/133885/5898988

java decreasing.java

/** * First attempt to look at difference signal. LocalMax and Min will * proboably be rewritten after this. * * @author Waleed Kadous * @version $Id: Decreasing.java,v 1.1.1.1 2002/06/28
www.eeworm.com/read/370636/9589468

m test_decreasing_nd.m

% test_decreasing_nd - test the nD alpert transform % % Copyright (c) 2004 Gabriel Peyr
www.eeworm.com/read/200619/15428499

m test_decreasing_nd.m

% test_decreasing_nd - test the nD alpert transform % % Copyright (c) 2004 Gabriel Peyr
www.eeworm.com/read/370636/9589423

m test_decreasing_1d.m

% test_decreasing_1d - test the 2D alpert transform for a C^alpha signal. % If the Alpert basis has more than alpha vanishing moments % (check the value of k), then the decreasing of the error % of
www.eeworm.com/read/370636/9589465

m test_decreasing_2d.m

% test_decreasing_2d - test the 2D alpert transform % % If the Alpert basis has more than alpha vanishing moments % (check the value of k), then the decreasing of the error % of reconstruction wit
www.eeworm.com/read/200619/15428486

m test_decreasing_1d.m

% test_decreasing_1d - test the 2D alpert transform for a C^alpha signal. % If the Alpert basis has more than alpha vanishing moments % (check the value of k), then the decreasing of the error % of
www.eeworm.com/read/200619/15428498

m test_decreasing_2d.m

% test_decreasing_2d - test the 2D alpert transform % % If the Alpert basis has more than alpha vanishing moments % (check the value of k), then the decreasing of the error % of reconstruction wit
www.eeworm.com/read/290205/8496354

m mmono.m

function f=mmono(x) %MMONO Test for Monotonic Vector. % MMONO(X) where X is a vector returns: % 2 if X is strictly increasing, % 1 if X is non decreasing, % -1 if X is non increasing, %
www.eeworm.com/read/283897/8980463

m unitary matrix q_lmd_diag.m

% % This function obtains a unitary matrix Q such that: d=diag(Q'*diag(lmd)*Q). % In other words, it gives a way to generate a matrix with given eigenvalues and diagonal elements. % % By Danie