搜索结果

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 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 ...

ellipse detection using the hough transform 作者 H.K. Yuen, J. Illingworth and J. Kittler Department of Electronics and Electrical Engineering University of Surrey, Guildford。对霍夫变换检测检测椭圆的原理有一定的参考意义。

Convolutional binary rate 1/3 nonsystematic code Dfree=16 K=7 (trellis length = 8) Connection vectors (from K. J. Larsen):

matlab实现的k均值聚类算法，可以实现对大量数据的有效分类

进程间通信14 说明了进程控制原语并且观察了如何调用多个进程。但是这些进程之间交换信息的 唯一方法是经由f o r k或e x e c传送打开文件，或通过文件系统。本章将说明进程之间相互通信的 其他技术—I P C（InterProcess Communication）。 ...

Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all *nix like systems.

K Nearest Neighbor algorithm Implementation and Overview

为了改善噪声e(k)为有色噪声模型的系统参数估计的统计特性，提出了一种增广矩阵的方法，称为增广最小二乘算法，MATLAB实现范例

k-均值聚类算法c语言版，经典的数据挖掘算法设计与实现