代码搜索：Fast
找到约 10,000 项符合「Fast」的源代码
代码结果 10,000
www.eeworm.com/read/320796/13418235
inf netrts5.inf
;; NETRTS5.INF (Windows98/ME/2000 combined inf for NDIS5 driver)
;;
;; Realtek RTL8139 Family Fast Ethernet Network Interface Cards.
;;
;; Copyright 2002, Realtek Semiconductor Corporation
;;
;;
www.eeworm.com/read/308835/13689914
h fft.h
/*
* fft.h - fast fourier transformation definitions(base DIT)
*
* Copyright (C) lartely
*
*/
#include "complex.h"
#include
#include
#include "df
www.eeworm.com/read/307176/13727172
cpp inffast.cpp
/* inffast.c -- fast decoding
* Copyright (C) 1995-2004 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
#include "stdafx.h"
#include "zutil.h"
#include "inf
www.eeworm.com/read/305575/13765429
m smartsmooth.m
function[y]=smartsmooth(x,f)
%SMARTSMOOTH Fast light smoothing for large matrices
%
% SMARTSMOOTH(X) for matrix X returns X smoothed by a 3x3 boxcar. X
% is zero-padded at the edges before smoot
www.eeworm.com/read/136177/13869037
txt changelog.txt
-- 0.261 2003-07-15 --
* Fixed user list problems (dc++ was too fast for nmdch)
* Fixed a queue frame crash
-- 0.26 2003-07-15 --
* Search for alternates now sets file type as well (and should
www.eeworm.com/read/238632/13871091
m szu.m
function a = szu(dE,T,q)
% Szu-Hartley "fast annealing" acceptance method supplied with SA Tools.
% Copyright (c) 2002, by Richard Frost and Frost Concepts.
% See http://www.frostconcepts.com/softw
www.eeworm.com/read/150221/5694179
m test.m
function test(mode)
% test nearest neighbor search based mex files
% recompile
error_flag = 0;
if nargin < 1
mode = 'all';
end
disp('Fast nearest neighbor search routines test')
load points.dat
www.eeworm.com/read/148359/5715698
asm inffas32.asm
;/* inffas32.asm is a hand tuned assembler version of inffast.c -- fast decoding
; *
; * inffas32.asm is derivated from inffas86.c, with translation of assembly code
; *
; * Copyright (C) 1995-200
www.eeworm.com/read/147682/5728139
m asptftrls.m
% [ff,bb,k,cf,b,g,w]=asptftrls(ff,bb,k,cf,b,g,w,a,x,d)
%
% Performs filtering and coefficient update using the
% Fast Transversal Recursive Least Squares (FTRLS) algorithm,
% also known
www.eeworm.com/read/140847/5779114
m ffa.m
% function [L,Ph,LL]=ffa(X,K,cyc,tol);
%
% Fast Maximum Likelihood Factor Analysis using EM
%
% X - data matrix
% K - number of factors
% cyc - maximum number of cycles of EM (default 100)
% tol - te