资源列表
kalman
- 使用opencv写的卡尔曼滤波的一个demo，跟踪鼠标指针的移动-Kalman filter using opencv write a demo, tracking the movement of the mouse pointer
IFA
- HFSS天线设计：在HFSS中设计倒F天线-HFSS antenna design: inverted F antenna
CP_Patch
- HFSS天线设计：在HFSS中设计圆极化矩形微带天线-HFSS antenna design: circularly polarized rectangular microstrip antenna
Coax_Patch
- HFSS天线设计：在HFSS中设计矩形微带天线-HFSS antenna design: rectangular microstrip antenna
approximation
- 利用C语言实现使用多项式插值逼近的算法，降低运算困难-Using C language to use polynomial interpolation approximation algorithms ，in order to reduce the computational difficulties
calculation
- 简单整数计算器，可以计算简单的加法减法乘法除法和乘方，输出为浮点。-simple calculate machine
122582345098
- 计算器 可换皮肤 功能稳定 很好 网络实用 很强大-Calculator function for skin very strong stable good network utilities
C_Algorithm
- 用C语言实现的各种算法的程序集合，基本包含了实用的全部基础算法，内容相当全面。-Using C language implementation of the various set of algorithm, the basic foundation that contains all the practical algorithm, the content is very comprehensive.
MyBinarySearch
- For this problem, you will need to create an second array that is smaller than the original whitelist. You need to go through the original whitelist twice: once to determine the number of unique items in the whitelist and a second time to copy the un
MyFibonacci
- The idea is that as Fibonnaci values are computed you store them in the array A. So when another F(n) is to be computed either A[n] is still 0 or else A[n] is already equal to F(n). If A[n] is 0, you have to make the usual recursive calls to comput
MyShuffleTest
- Suppose we start with N=3 and run the shuffling test four times, resulting in the arrays: [2, 0, 1] [2, 1, 0] [2, 0, 1 ] (This not very likely, but i s possible) Then the resulting count array would be: 0: 0 3 1 1: 0 1 3
myEuclid
- compute the greatest common divisor of two integers