搜索结果
找到约 348 项符合
Dot-matrix 的查询结果
数学计算 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 ...
多国语言处理 The angles in degrees of the two spatially propagating signals Compute the array response vectors o
The angles in degrees of the two spatially propagating signals
Compute the array response vectors of the two signals
Compute the true covariance matrix
Internet/网络编程 使用INTEL矢量统计类库的程序,包括以下功能:  Raw and central moments up to 4th order  Kurtosis and
使用INTEL矢量统计类库的程序,包括以下功能:
&#61623 Raw and central moments up to 4th order
&#61623 Kurtosis and Skewness
&#61623 Variation Coefficient
&#61623 Quantiles and Order Statistics
&#61623 Minimum and Maximum
&#61623 Variance-Covariance/Correlation matrix
&#61623 Pooled/Group Varianc ...