Search - max - CodeBus

Search - max - List

[Editor] DetDTMF1 DL : 0: for K_ind = 1 : length(k) y = goertzel_algo ( dtmf_output,k(K_ind),Num_of_samples) if (K_ind == 1) this appends each Kth array to y1(1 : Num_of_samples) = y( 1 : Num_of_samples) the output array else v_sum = v_sum + Num_of_samples y1(v_sum + 1 : v_sum + Num_of_samples) = y( 1: Num_of_samples) end ymax(K_ind) = max(y) end Goertzel_array = ymax To find the two maximum peaks temp = ymax(1) temp1 = 1 for s = 2:8 if (ymax(s) > temp) temp = ymax(s) temp1 = s -for K_ind = 1 : length(k) y = goertzel_algo ( dtmf_output,k(K_ind),Num_of_samples) if (K_ind == 1) this appends each Kth array to y1(1 : Num_of_samples) = y( 1 : Num_of_samples) the output array else v_sum = v_sum+ Num_of_samples y1(v_sum+ 1 : v_sum+ Num_of_samples) = y( 1: Num_of_samples) end ymax(K_ind) = max(y) end Goertzel_array = ymax To find the two maximum peaks temp = ymax(1) temp1 = 1 for s = 2:8 if (ymax(s) > temp) temp = ymax(s) temp1 = s
Date : 2025-12-28 Size : 1kb User : piranaaa
[Editor] file1 DL : 0: min max in c language
Date : 2025-12-28 Size : 1kb User : Thaer
[Editor] graphpartition DL : 0: MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report: Joã o Hespanha. An efficient MATLAB Algorithm for Graph Partitioning. Technical Report, University of California, Oct. 2004. Available at http://www.ece.ucsb.edu/~hespanha/techrep.html. This algorithm was extensively used in this paper: C. Lim, S. Bohacek, J. Hespanha, K. Obraczka. Hierarchical Max-Flow Routing. In Proc. of the IEEE GLOBECOM, Nov. 2005.
Date : 2025-12-28 Size : 120kb User : leyla