代码搜索：Fast
找到约 10,000 项符合「Fast」的源代码
代码结果 10,000
www.eeworm.com/read/240204/4576992
in makeinclude.in
#
# "$Id: makeinclude.in,v 1.1.1.1 2003/06/03 22:25:27 agno Exp $"
#
# Make include file for the Fast Light Tool Kit (FLTK).
# @configure_input@
#
# Copyright 1998-2003 by Bill Spitzak and other
www.eeworm.com/read/229812/4753141
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/225759/4792552
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
www.eeworm.com/read/225759/4792677
m marginal_nodes.m
function marginal = marginal_nodes(engine, nodes, t, isfam)
% MARGINAL_NODES Compute the marginal on the specified query nodes (bk_fast)
%
% marginal = marginal_nodes(engine, i, t)
% returns Pr(X(i,
www.eeworm.com/read/225759/4792704
m jtree_unrolled_dbn_inf_engine.m
function engine = jtree_unrolled_dbn_inf_engine(bnet, T, onodes, fast, compiled)
% JTREE_UNROLLED_DBN_INF_ENGINE Unroll the DBN for T time-slices and apply jtree to the resulting static net
%
% engine
www.eeworm.com/read/225759/4792706
m marginal_nodes.m
function marginal = marginal_nodes(engine, nodes, t, isfam)
% MARGINAL_NODES Compute the marginal on the specified query nodes (bk_fast)
%
% marginal = marginal_nodes(engine, i, t)
% returns Pr(X(i,
www.eeworm.com/read/218315/4860963
h enumerations.h
//
// "$Id: Enumerations.H 5389 2006-09-01 15:39:19Z spitzak $"
//
// Enumerations for the Fast Light Tool Kit (FLTK).
//
// Copyright 1998-2006 by Bill Spitzak and others.
//
// This library is free
www.eeworm.com/read/216802/4884386
h monitor.h
#ifndef _WIN32K_MONITOR_H
#define _WIN32K_MONITOR_H
struct GDIDEVICE;
/* monitor object */
typedef struct _MONITOR_OBJECT
{
HANDLE Handle; /* system object handle */
FAST_MUTE
www.eeworm.com/read/216450/4893959
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/215485/4903444
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