登录
首页 » Visual C++ » Image_Registration

Image_Registration

于 2010-04-30 发布 文件大小:7455KB
0 82
下载积分: 1 下载次数: 33

代码说明:

  Image Registration һ

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Strategy
    关键词:人工智能课大作业 四子棋 策略文件 阿尔法贝塔剪枝算法(Keywords: artificial intelligence courses operating four sons chess strategy documents Alpha Beta pruning algorithm)
    2021-04-27 23:08:44下载
    积分:1
  • MemLeakAnalyse
    简单的内存泄露的检查和测试的示例代码,如果你的程序有内存泄露可以参考一下(Simple memory leak inspection and testing of sample code, if you have memory leak procedures for reference)
    2007-09-26 11:42:24下载
    积分:1
  • -个完整的ftp程序源代码
    关于FTP的代码,支持网络间的文件传输,用户权限的设定.(on FTP code, the support network file transfer, set user privileges.)
    2005-05-17 21:15:40下载
    积分:1
  • Fmc880511P
    可在FPGA上运行的8051 IP coore,是学习FPGA及SPOC的好资料。 (8051 IP coore, can be run on the FPGA is good information to learn FPGA and SPOC.)
    2012-06-11 18:59:13下载
    积分:1
  • thecubeofpower
    This a cube of power of 3D Graphics. Very simple OpenGL example that shows how to create Your s first 3D scene(This a cube of power of 3D Graphics.Very simple OpenGL example that shows how to create Your s first 3D scene)
    2009-01-06 05:59:40下载
    积分:1
  • a
    说明:  将数组a[0]~a[size-1] 中重复的字母删除(仅仅保留第一次出现的字母,后续的重复字母均删除)(The array a [0] ~ a [size-1] Remove duplicate letters (just the first time to retain the letters, follow-up letters were removed duplication))
    2010-04-15 11:17:06下载
    积分:1
  • Backgammon
    五子连珠的VC源码,简单有趣 (Five or VC source, easy and fun )
    2013-07-20 17:54:18下载
    积分:1
  • sushu
    素数的判定,miller-rabin,sol-str,leman,fermat等。都可以运行,下完自后自己稍微改改就可以用。(Primes judgment, miller-rabin, sol-str, leman, fermat so on. Can run is finished after their own little changed since it can be used.)
    2013-07-25 19:21:17下载
    积分:1
  • 3DSPMAXPmoxing
    对于很多的模型,很难深刻的导入进去,3DS+MAX模型在OPENGL中的读取与重现(For many models, it is difficult to import into a deep, 3DS+MAX model OPENGL read and reproduce in)
    2013-09-14 11:47:55下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • 696518资源总数
  • 105661会员总数
  • 6今日下载