代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/346158/3189476
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/346158/3189492
m fg3.m
% make a factor graph corresponding to an HMM with Gaussian outputs, where we absorb the
% evidence up front
seed = 1;
rand('state', seed);
randn('state', seed);
T = 3;
Q = 3;
O = 2;
cts_obs = 1;
www.eeworm.com/read/307266/3725972
c williams.c
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/307266/3726090
cpp pollard.cpp
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/307266/3726206
cpp williams.cpp
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/307266/3726317
c williams.c
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/307266/3726440
cpp pollard.cpp
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/307266/3726558
cpp williams.cpp
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/292984/3935716
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/292984/3935732
m fg3.m
% make a factor graph corresponding to an HMM with Gaussian outputs, where we absorb the
% evidence up front
seed = 1;
rand('state', seed);
randn('state', seed);
T = 3;
Q = 3;
O = 2;
cts_obs = 1;