代码搜索：Matrix
找到约 10,000 项符合「Matrix」的源代码
代码结果 10,000
www.eeworm.com/read/302727/13828208
m quaterniontorotationmatrix.m
function R = QuaternionToRotationMatrix(Q)
if any( size(Q) ~= [4,1] )
error('Q must be a 4x1 vector (quaternion)')
end
Q=Q/norm(Q); %ensure unit quaternion
X=Q(1);
Y=Q(2);
Z=Q(3);
W=
www.eeworm.com/read/302727/13828233
m antisymmetricmatrixfromvector.m
function A = AntiSymmetricMatrixFromVector(a);
% As a previous poster wrote, you need to do this by components. But,
% there is a slight trick that makes it fairly easy. The problem is
% work
www.eeworm.com/read/302621/13830791
cpp shape.cpp
/////////////////////////////////////////////////////////////
// Flash Plugin and Player
// Copyright (C) 1998,1999 Olivier Debon
//
// This program is free software; you can redistribute it and/or
/
www.eeworm.com/read/302275/13838258
cpp 三次样条_070460.cpp
#include
#include
#include
//输入节点位置及函数值
void init_xy_1(int* n,double x[100],double y[100],double* Do,double* Dn)
{
double d0,dn;
int m;
cout
www.eeworm.com/read/301492/13858270
m outlier_demo.m
% Example for spatial outlier detection
% Created by Pusheng Zhang and Shashi Shekhar
% University of Minnesota
% 5/8/2003
%
% Let's start the script for spatial outlier detection
% First we will load
www.eeworm.com/read/301214/13863353
m lscylinder.m
function [x0n, an, rn, d, sigmah, conv, Vx0n, Van, urn, GNlog, ...
a, R0, R] = lscylinder(X, x0, a0, r0, tolp, tolg, w)
% ----------------------------------------------------------------
www.eeworm.com/read/238634/13870833
m sima1.m
function [nw,a1,i] = sima1(w,p,lr,rho,pf)
%SIMA1 ART1 simulation function.
% Each input vector is presented to the network one at a time.
% (See COMPET, HARDLIM)
%
% [NW,A1,
www.eeworm.com/read/152629/5672709
java minimizable.java
/* Copyright (C) 2002 Univ. of Massachusetts Amherst, Computer Science Dept.
This file is part of "MALLET" (MAchine Learning for LanguagE Toolkit).
http://www.cs.umass.edu/~mccallum/mallet
Th
www.eeworm.com/read/151133/5685884
c 逆矩阵.c
#define N 5 /*[注]：修改6为你所要的矩阵阶数*/
#include "stdio.h"
#include "conio.h"
/*js()函数用于计算行列式,通过递归算法实现*/
int js(s,n)
int s[][N],n;
{int z,j,k,r,total=0;
int b[N][N];/*b[N][N]用于存放，在矩阵s[
www.eeworm.com/read/150018/5694578
py encoders.py
"""
Copyright 2003 Mitsubishi Electric Research Laboratories All Rights
Reserved. Permission to use, copy and modify this software and its
documentation without fee for educational, r