搜索结果
找到约 289 项符合
matrix 的查询结果
按分类筛选
- 全部分类
- matlab例程 (41)
- 数学计算 (34)
- 其他 (25)
- 数值算法/人工智能 (18)
- 单片机开发 (15)
- Java编程 (10)
- 汇编语言 (8)
- 数据结构 (8)
- 人工智能/神经网络 (7)
- 通讯/手机编程 (6)
- 其他嵌入式/单片机内容 (6)
- Delphi控件源码 (5)
- 文章/文档 (5)
- 书籍 (5)
- 嵌入式/单片机编程 (4)
- 压缩解压 (4)
- 其他行业 (4)
- 行业发展研究 (4)
- Linux/Unix编程 (4)
- 精品软件 (4)
- DSP编程 (3)
- 文件格式 (3)
- 驱动编程 (3)
- 软件设计/软件工程 (3)
- 技术资料 (3)
- 学术论文 (2)
- 开发工具 (2)
- 单片机编程 (2)
- 书籍源码 (2)
- *行业应用 (2)
- 多国语言处理 (2)
- 编译器/解释器 (2)
- 电子书籍 (2)
- 嵌入式Linux (2)
- 数据库系统 (2)
- VC书籍 (2)
- 加密解密 (2)
- VHDL/FPGA/Verilog (2)
- 微处理器开发 (2)
- 软件 (2)
- VIP专区 (2)
- LED驱动及控制 (1)
- 通信网络 (1)
- 可编程逻辑 (1)
- 接口技术 (1)
- 生物技术 (1)
- Applet (1)
- Windows CE (1)
- 软件工程 (1)
- Jsp/Servlet (1)
- 电子政务应用 (1)
- 其他书籍 (1)
- FlashMX/Flex源码 (1)
- JavaScript (1)
- 编辑器/阅读器 (1)
- STL (1)
- 教育系统应用 (1)
- 并行计算 (1)
- Internet/网络编程 (1)
- CA认证 (1)
- 通讯编程文档 (1)
- 网络 (1)
- 3G开发 (1)
- Matlab (1)
- DSP工具/软件 (1)
- 其他 (1)
数学计算 Mapack可用来做矩阵运算 Mapack is a .NET class library for basic linear algebra computations. It supports th
Mapack可用来做矩阵运算
Mapack is a .NET class library for basic linear algebra computations. It supports the following matrix operations and properties: Multiplication, Addition, Subtraction, Determinant, Norm1, Norm2, Frobenius Norm, Infinity Norm, Rank, Condition, Trace, Cholesky, LU, QR, Single V ...
matlab例程 The software is capable to simulate space time code [1] for QPSK modulation using different number o
The software is capable to simulate space time code [1] for QPSK modulation using different number of state. Examples of generator matrix up to 256 stetes are provided. Variable signal to noise ratio (SNR) might be applied to produce bit error rate (BER) or frame error rate (FER) curves.
数学计算 SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems
SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and ...
JavaScript Points in Euclidean space, implemented as double[].Includes simple geometric operations.Uses matrice
Points in Euclidean space, implemented as double[].Includes simple geometric operations.Uses matrices a matrix is represented as an array of Pnts
VC书籍 C:Documents and SettingsAdministrator桌面VC++多媒体特效制作百例CHAR09Matrix
C:\Documents and Settings\Administrator\桌面\VC++多媒体特效制作百例\CHAR09\Matrix
数学计算 IML package provides efficient routines to solve nonsingular systems of linear equations, certifie
IML package provides efficient routines to solve nonsingular systems of
linear equations, certified solve any shape systems of linear equations,
and perform mod p matrix operations, such as computing row-echelon form,
determinant, rank profile, inverse of a mod p matrix.
编译器/解释器 c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths ...
其他 Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the ...
其他 In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out ...
其他 Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a pr
Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be ...