代码搜索结果
找到约 10,000 项符合
Algorithm 的代码
hlle.m
function mappedX = hlle(X, no_dims, k, eig_impl)
%HLLE Runs the Hessian LLE algorithm
%
% mappedX = hlle(X, no_dims, k, eig_impl)
%
% Runs the Hessian LLE algorithm on dataset X to reduce its d
hlle.m
function mappedX = hlle(X, no_dims, k, eig_impl)
%HLLE Runs the Hessian LLE algorithm
%
% mappedX = hlle(X, no_dims, k, eig_impl)
%
% Runs the Hessian LLE algorithm on dataset X to reduce its d
widekernelpls.fit.r
### widekernelpls.fit.R: Kernel PLS fit algorithm for wide data.
### $Id: widekernelpls.fit.R 138 2007-09-28 15:24:29Z bhm $
###
### Implements an adapted version of the algorithm described in
### Ra
bestmdhash.cpp
//See internet RFC 1321, "The MDHash Message-Digest Algorithm"
/* MDHashC.C - RSA Data Security, Inc., MDHash message-digest algorithm
*/
/*
Copyright (C) 1991-2, RSA Data Security, Inc. Cre
a3a82.txt
// algorithm.cpp : Defines the entry point for the DLL application.
//
#include "stdafx.h"
#include "algorithm.h"
#include
#include
#include
#include
bestmdhash.cpp
//See internet RFC 1321, "The MDHash Message-Digest Algorithm"
/* MDHashC.C - RSA Data Security, Inc., MDHash message-digest algorithm
*/
/*
Copyright (C) 1991-2, RSA Data Security, Inc. Cre
dcta.m
% dcta.m
% Test out a fast 1-d dct algorithm for the imagine chip implementation
% From Pennebaker/Mitchell, pg. 50-52. See also Arai, Agui, Nakajima
% This algorithm is based on the 16-pt D
sample4_1.java
/*
* 示例程序Sample4_1: LEquations类的基本用法
*/
package javaalgorithm.sample;
import javaalgorithm.algorithm.Matrix;
import javaalgorithm.algorithm.LEquations;
public class Sample4_1
{
public
contents.m
% Pre-image problem for RBF kernel.
%
% rbfpreimg - Schoelkopf's fixed-point algorithm.
% rbfpreimg2 - Gradient optimization.
% rbfpreimg3 - Kwok-Tsang's algorithm.
%
% About: Statistical Pattern
hlle.m
function mappedX = hlle(X, no_dims, k, eig_impl)
%HLLE Runs the Hessian LLE algorithm
%
% mappedX = hlle(X, no_dims, k, eig_impl)
%
% Runs the Hessian LLE algorithm on dataset X to reduce its d