登录
首页 » matlab » Projet

Projet

于 2011-05-30 发布 文件大小:7KB
0 260
下载积分: 1 下载次数: 3

代码说明:

  insertion of two images iand how to exctract them

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

发表评论

0 个回复

  • Optimal-Estimation-of-Dynamic-System
    说明:  经典最优统计的书,涉及到很多图像处理的方法,可以一读(09 CVPR article on the code to the fog, the classic image processing methods, you can change image to see different results.)
    2011-03-07 13:54:36下载
    积分:1
  • bakema
    巴克码的编码程序,基础程序可以好好学习下,希望有帮助!(Barker coding procedures, based on the program can learn under, want to help!)
    2013-10-13 20:59:00下载
    积分:1
  • class_optical_flow
    一个经典的关于光流法的运动图像目标检测 已调试成功(Moving image target detection of optical flow method is a classic has been successful commissioning)
    2013-11-16 10:02:55下载
    积分:1
  • DFmimo
    Simulation for wireless sensor relaying network using DF model
    2016-04-17 17:40:41下载
    积分:1
  • mimoblastQR
    mimo多天线blast系统qr算法在matlab上的实现(mimo multi-antenna systems qr algorithm blast in the realization of the matlab)
    2009-05-04 14:38:37下载
    积分:1
  • simulink-problem
    Compensator design Parasympathetic control of the heart in cats
    2014-11-30 16:22:16下载
    积分:1
  • NLMS-program
    本代码对于应用广泛的LMS和NLMS的各种性能进行了系统的比较,并MATLAB仿真分析比较了两种算法的性能。(The code for the widely used LMS and NLMS variety of performance comparison of the system and MATLAB simulation analysis and comparison of the performance of the two algorithms.)
    2013-04-18 10:19:38下载
    积分:1
  • algorithm_k
    It is a small part of code that used for clustering approach
    2015-03-18 15:48:22下载
    积分:1
  • game-theory
    We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm
    2015-03-23 14:25:30下载
    积分:1
  • matlab1
    一个讲述MATLAB偏微分方程工具箱的 PDF 文件(A MATLAB PDE toolbox about PDF files)
    2009-12-16 19:42:23下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载