代码搜索:efficient

找到约 1,594 项符合「efficient」的源代码

代码结果 1,594
www.eeworm.com/read/152843/5659248

s putuser.s

/* * __put_user functions. * * (C) Copyright 2005 Linus Torvalds * * These functions have a non-standard call interface * to make them more efficient, especially as they * return an error value
www.eeworm.com/read/152843/5659250

s getuser.s

/* * __get_user functions. * * (C) Copyright 1998 Linus Torvalds * * These functions have a non-standard call interface * to make them more efficient, especially as they * return an error value
www.eeworm.com/read/152843/5660192

s getuser.s

/* * __get_user functions. * * (C) Copyright 2001 Hirokazu Takata * * These functions have a non-standard call interface * to make them more efficient, especially as they * return an error valu
www.eeworm.com/read/476030/6772700

vhd counters.vhd

-- MAX+plus II VHDL Example -- Efficient Counter Inference -- Copyright (c) 1994 Altera Corporation ENTITY counters IS PORT ( d : IN INTEGER RANGE 0 TO 255; clk : IN BIT; clear
www.eeworm.com/read/270032/11050870

c boundsphere.c

/* An Efficient Bounding Sphere by Jack Ritter from "Graphics Gems", Academic Press, 1990 */ /* Routine to calculate near-optimal bounding sphere over */ /* a set of points in 3D */ /* This contai
www.eeworm.com/read/147693/12538682

pl fig9_3.pl

% Figure 9.3 A more efficient implementation of quicksort using difference-pair % representation for lists. Relation split( X, List, Small, Big) is as defined % Figure 9.2. % quicksort( List,
www.eeworm.com/read/147268/12570672

vhd counters.vhd

-- MAX+plus II VHDL Example -- Efficient Counter Inference -- Copyright (c) 1994 Altera Corporation ENTITY counters IS PORT ( d : IN INTEGER RANGE 0 TO 255; clk : IN BIT; clear
www.eeworm.com/read/202858/15371706

readme

Implementation of the segmentation algorithm described in: Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb and Daniel P. Huttenlocher International Journal of Computer Vision, 59(2) S
www.eeworm.com/read/188651/8521260

c inftrees.c

/* inftrees.c -- generate Huffman trees for efficient decoding * Copyright (C) 1995-2002 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zuti
www.eeworm.com/read/430318/8756725

m motionestsestss.m

% Computes motion vectors using Simple and Efficient TSS method % % Based on the paper by Jianhua Lu and Ming L. Liou % IEEE Trans. on Circuits and Systems for Video Technology % Volume 7, Number