搜索资源列表
LaserCommunicationSimulationSystem
- 建立GEO和LEO的轨道，并计算他们间方位角和俯仰角速度及加速度，多普勒频移等重要参数。-established GEO and LEO orbits, and calculate their azimuth and pitch between angular velocity and acceleration, Doppler frequency shift and other important parameters.
Random_Forest_fortran
- 加洲大学Leo Breiman编写的Random Forests(随机器森林)各个版本的fortran代码 可以实现分类,以及回归!-University of California Leo Breiman prepared by Random Forests (random for forest ) fortran various versions of the code can be achieved classification and regression!
RandomForest
- 随机森林论文作者写的随机森林代码，采用matlab混合编程，需要安装Fortran compiler-An interface to the random forest algorithm (version 3.3) written by Leo Breiman and Adele Cutler. This tool is for windows MATLAB R13 only
RF
- Random Forests的Fortran版本，Leo Breiman and Adele Cutler 设计-Random Forests of the Fortran version, Leo Breiman and Adele Cutler Design
89346509RandomForestMatlabVersion
- 這是一個 Matlab的（和獨立應用）端口的出色的機器學習算法，隨機森林` - 由Leo布賴曼等。從 R -源由Andy鴻等。 http://cran.r-project.org/web/packages/randomForest/index.html（Fortran的原由Leo布賴曼和Adele卡特勒，研究港口安迪鴻和馬修維納。）當前的代碼版本是基於 4.5-29從來源 randomForest包。-This is a Matlab (and Standalone application) p
search_graph
- 一个python程序，实现了无向图的结构模拟，以及广度优先搜索的算法，以及显示最短路径之一。用leo+ulipad实现。-A python program to realize the structure of an undirected graph simulation, as well as the breadth-first search algorithm, and display one of the shortest path. By leo+ ulipad achieved.
Bagging_predictors
- 介绍Bagging最早的、最经典的文献，作者是Bagging和随机森林的创始人LEO BREIMAN-Bagging first introduced, the most classic literature, the author is the founder of Bagging and random forests LEO BREIMAN
Leo-J.-Guibas-
- 红黑树的c源码实现与剖析，用c语言完整实现过红黑树，但个人感觉，代码还是不够清晰。特此，再奉献出一份c++的完整实现源码，以飨读者。-Leo J. Guibas
Relatorio-leo
- The damping factor is the comparison between the square of the frequency and the resonance frequency Neper. In this paper we analyze the variations in the behavior of the circuit when changing resistor values .
flyaway
- 输入：第一行是3个正整数，m(1≤m≤100)，n(1≤n≤100)，D(1≤D≤100)。表示原野是m*n的矩阵，法里奥最多只能飞行距离为D。 接下来的m行每行有n个字符，相互之间没有空格。P表示当前位置是平地，L则表示湖泊。假定(1,1)和(m,n)一定是平地。 输出：一个整数，表示法里奥到达基地需要的最短时间。如果无法到达基地，则输出impossible。-Input: The first line is the three positive integers, m (1 ≤ m
grady2011segmentation
- The random walker algorithm was introduced in the paper: Leo Grady and Gareth Funka-Lea, "Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials", in Proceedings of the 8th ECCV04, Workshop on Compute
orbit.m
- Displays the orbit of a LEO satellites
crossover-point
- C++实现的卫星测高交叉点模拟计算，程序中包含6个低轨卫星SP3精密星历数据。-The crosspoint analog C++ achieve altimetry calculation program contains 6 the LEO satellite SP3 precision ephemeris data.
bianhuakuaiman
- leo卫星通信系统中矢量化多普勒頻移计算方法。-A quantization calculation method for doppler frequency shift in LEO communications system.
LEODOPPLER
- 电网_LEO中低轨卫星多普勒随轨道高度和最大仰角的变化-LEO satellite doppler along with the change of rail height and maximum elevation
random forest
- 文档包括两部分内容，一部分是Leo Breiman关于随机森林的介绍解释文档pdf，内有实例和分析，介绍的很清楚，是英文版，不过不是很难；第二部分是Leo Breiman的官方程序，从网站下载的，matlab版本。(The document includes two parts, one part is Leo Breiman on random forest introduced to explain the document PDF, there are examples and analy
leo_orbit
- Control mechanishm for Reaction wheel and its motion/angular velocity control