代码搜索：efficient
找到约 1,594 项符合「efficient」的源代码
代码结果 1,594
www.eeworm.com/read/264095/4293408
s memset.s
/*
* linux/arch/alpha/memset.S
*
* This is an efficient (and small) implementation of the C library "memset()"
* function for the alpha.
*
* (C) Copyright 1996 Linus Torvalds
*
* This routine
www.eeworm.com/read/161121/5557048
s memset.s
/*
* linux/arch/alpha/memset.S
*
* This is an efficient (and small) implementation of the C library "memset()"
* function for the alpha.
*
* (C) Copyright 1996 Linus Torvalds
*
* This routine
www.eeworm.com/read/152843/5658877
s memset.s
/*
* linux/arch/alpha/memset.S
*
* This is an efficient (and small) implementation of the C library "memset()"
* function for the alpha.
*
* (C) Copyright 1996 Linus Torvalds
*
* This routine
www.eeworm.com/read/202876/15370624
m manual_corner_extraction_no_read.m
%% This code allows complete manual reselection of every corner in the
%% images.
%% This tool is specifically useful in the case of highly distorted images.
%%
%% Use it when in memory efficient
www.eeworm.com/read/389586/8512673
txt 53. c28x fast fourier transforms library (sprc081).txt
Fast Fourier Transforms are an efficient class of algorithms for the digital computation of the N-point Fourier transform (DFT). In general, their input sequence are assumed to be complex. In many rea
www.eeworm.com/read/186716/8914585
m fftsize.m
function out = fftsize(in)
% FFTSIZE ..... Determines the fft block size for efficient computation,
% Output is a power or 2.
%
% FFTSIZE(N) generates minimum power of 2 that is greater than
www.eeworm.com/read/283403/9023790
txt 53. c28x fast fourier transforms library (sprc081).txt
Fast Fourier Transforms are an efficient class of algorithms for the digital computation of the N-point Fourier transform (DFT). In general, their input sequence are assumed to be complex. In many rea
www.eeworm.com/read/380660/9135655
readme
etrace: A run-time tracing tool
-------------------------------
These source files comprise a simple but efficient utility that allows the
display of a function call tree in a C program at run-time.
www.eeworm.com/read/422223/10654164
txt sigmod_2001_elementary.txt
Efficient computation of Iceberg cubes with complex measuresJiawei HanSchool of Computing Science, Simon F
www.eeworm.com/read/421666/10713158
mod dea.mod
/* Data Envelopment Analysis (DEA)
*
* DEA quantifies the relative efficiency of decision making units (DMUs) by
* finding the efficient frontier in multiple input multiple output data. The
* inp