1、聚类算法简介 2、K-means算法 3、DBSCAN算法 4、层次聚类算法

电子科技大学：《算法设计与分析 Design and Analysis of Algorithms》研究生课程教学资源（课件讲稿，英文版）Stable Matching

电子科技大学：《算法设计与分析 Design and Analysis of Algorithms》研究生课程教学资源（课件讲稿，英文版）03 Maximum Flow

5.1 Load Balancing 5.2 Center Selection 5.3 The Pricing Method: Vertex Cover 5.4 LP Rounding: Vertex Cover * 5.5 Load Balancing Reloaded 5.6 Knapsack Problem

4.1 Polynomial-Time Reductions 4.2 Reductions via \Gadgets\ 4.3 Definition of NP 4.4 NP-Completeness 4.5 Sequencing Problems 4.6 Partitioning Problems 4.7 Graph Coloring 4.8 Numerical Problems

2.1 Analysis 2.2 Asymptotic Order of Growth(渐进分析) 2.3 Three Techniques for Designing Algorithms 1. Greedy Algorithms 2. Divide and Conquer 3. Dynamical Programming

NR概述 NR的网络架构 NR的基本概念 NR的物理信道

电子科技大学：《汉外语言对比研究 Compative Study of Chinese and Foreign Languages》课程教学资源（课件讲稿）Chapter 02 Conception and Nomenclature

电子科技大学：《汉外语言对比研究 Compative Study of Chinese and Foreign Languages》课程教学资源（课件讲稿）Chapter 04 Stativeness and Dynamicity

电子科技大学：《汉外语言对比研究 Compative Study of Chinese and Foreign Languages》课程教学资源（课件讲稿）Chapter 06 Rigidity and Flexibility