代码搜索:rows

找到约 10,000 项符合「rows」的源代码

代码结果 10,000
www.eeworm.com/read/461277/7230266

py util.py

""" General utility functions that don't belong in cvxmod.base. """ # Copyright (C) 2006-2008 Jacob Mattingley and Stephen Boyd. # # Portions of this file were contributed by Timothy Hunter. # # Thi
www.eeworm.com/read/460435/7251203

m prmem.m

%PRMEM Size of memory and loops for intermediate results % % [LOOPS,ROWS,LAST] = PRMEM(M,K) % % Assume that an array of the size [M x K] has to be computed. The % numbers of LOOPS and ROWS are de
www.eeworm.com/read/458802/7289189

java intmatrix.java

/* IntMatrix.java */ import java.io.*; import java.awt.*; /** * An example implementation of the DrawingObj interface * that can be added to the drawingPanel (an instance of *
www.eeworm.com/read/455115/7377672

m lowpassfilter.m

% LOWPASSFILTER - Constructs a low-pass butterworth filter. % % usage: f = lowpassfilter(sze, cutoff, n) % % where: sze is a two element vector specifying the size of filter % to co
www.eeworm.com/read/455115/7377726

m imtrans.m

% IMTRANS - Homogeneous transformation of an image. % % Applies a geometric transform to an image % % [newim, newT] = imTrans(im, T, region, sze); % % Arguments: % im - The image to be t
www.eeworm.com/read/455115/7377786

m plotgaborfilters.m

% PLOTGABORFILTERS - Plots log-Gabor filters % % The purpose of this code is to see what effect the various parameter % settings have on the formation of a log-Gabor filter bank. % % Usage: [Ffilter,
www.eeworm.com/read/455115/7377850

m frankotchellappa.m

% FRANKOTCHELLAPPA - Generates integrable surface from gradients % % An implementation of Frankot and Chellappa'a algorithm for constructing % an integrable surface from gradient information. % % Usa
www.eeworm.com/read/455115/7377856

m testp.m

% Function to make ramps test surface for shape from shapelet testing % % Usage: % function [z,s,t] = testp(noise) % % Arguments: % noise - An optional parameter specifyin
www.eeworm.com/read/450608/7480593

m prmem.m

%PRMEM Size of memory and loops for intermediate results % % [LOOPS,ROWS,LAST] = PRMEM(M,K) % % Assume that an array of the size [M x K] has to be computed. The % numbers of LOOPS and ROWS are de
www.eeworm.com/read/441245/7673426

m prmem.m

%PRMEM Size of memory and loops for intermediate results % % [LOOPS,ROWS,LAST] = PRMEM(M,K) % % Assume that an array of the size [M x K] has to be computed. The % numbers of LOOPS and ROWS are de