资源列表
yhjsf
- 一个银行家算法 感觉还不错 需要可以下来看看哦 可能对你有用-it is about yhj
Warshalls-Transitive-Closure
- In computer science, the Floyd–Warshall algorithm (also known as Floyd s algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm[clarification needed]) is a graph analysis algorithm for finding shortest paths in a weighted graph
Bellman-Fords-Shortest-Paths
- The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem.
calculate_LCTD4
- L类四阶复延迟时频分布程序，可用来做仿真信号的时频分布-L class of fourth order delay time-frequency distribution of complex procedures, can be used for simulation of time-frequency distribution
HeapSort
- Heapsort is a comparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a well implemented quicksort, it has the advantage of a more favorable worst-case O(n log n) runtim
QuickSort
- Quicksort is a sorting algorithm developed by Tony Hoare that, on average, makes O(nlogn) (big O notation) comparisons to sort n items.
motion-detection
- 帧差法实现运动视频分割 目标提取 行为描述 -Motion Detection
horses
- Algorithm resolution.
fft
- 快速傅里叶变换的c++源程序，用于求解fft问题，附有matlab版-Fast Fourier transform c++ source code for solving fft problem, with matlab version
facedetection
- 人脸检测程序，只能针对单人，内附一些图片-Face detection process, only for a single person, enclosing some pictures
LOG-op
- LOG算子，实现边沿检测，内附readme-LOG operator, to achieve edge detection, included readme
algorithmt
- 浙江大学ACM算法设计课的全部课件，比较详细的讲解了ACM的入门知识点-Zhejiang University ACM algorithm design course all courseware, a more detailed explanation of the knowledge point of entry ACM