搜索结果
找到约 554 项符合
matrix-Vector 的查询结果
VHDL/FPGA/Verilog 这是一个Quartus的工程文件和verilog代码
这是一个Quartus的工程文件和verilog代码，讲如何把memory 变成vector
通讯/手机编程 In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for un
In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for uniformly quantized synchronous code division multiple access (CDMA) signals in additive white Gaussian noise (AWGN) channels.This project is mainly based on the representation of uniform quantizer by ...
数学计算 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.
STL 一个全排列算法的实现
一个全排列算法的实现，利用了C++模板技术以及STL 中的 Vector
编译器/解释器 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
matlab例程 统计模式识别工具箱（Statistical Pattern Recognition Toolbox）包含： 1
统计模式识别工具箱（Statistical Pattern Recognition Toolbox）包含：
1，Analysis of linear discriminant function
2，Feature extraction: Linear Discriminant Analysis
3，Probability distribution estimation and clustering
4，Support Vector and other Kernel Machines