X-MODEM 协议文件传输在凌阳CPU上实现的相关完整资料
上传时间： 2017-05-23
上传用户：redmoons
X modem 协议文件传输在51单片机上实现源代码
上传时间： 2017-05-23
上传用户：ommshaggar
Article:Reconstructing 3D Tree Models from Instrumented Photographs
标签： Reconstructing Instrumented Photographs Article
上传时间： 2017-05-24
上传用户：zhangjinzj
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
标签： followingconditions tree completely satisfying
上传时间： 2017-05-25
上传用户：2467478207
Linux kernel 2.6.28.x 中文手册
上传时间： 2017-05-25
上传用户：LouieWu
Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn step5:If the first packet was generated at time [0], than the second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2], and so on …. Random-number generation 1.static method random from class Math -Returns doubles in the range 0.0 <= x < 1.0 2.class Random from package java.util -Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values -Is seeded with the current time of day to generate different sequences of numbers each time the program executes
标签： Generate Possion between random
上传时间： 2017-05-25
上传用户：bibirnovis
red black tree red black tree
上传时间： 2017-05-25
上传用户：小草123
c++实现的KNN库:建立高维度的K-d tree,实现K邻域搜索，最小半径搜索
上传时间： 2013-11-29
上传用户：wpt
卡巴斯基_KAV 26KIS_6.x 267.x通用破解器，可更新病毒库
上传时间： 2013-12-14
上传用户：1427796291
用 gtk 实现的 mplayer 的界面（原界面用 x 底层函数实现），包含透明和不规则效果
上传时间： 2014-01-24
上传用户：集美慧
