登录
首页 » PDF » Compressed Sensing

Compressed Sensing

于 2019-04-29 发布 文件大小:315KB
0 72
下载积分: 1 下载次数: 1

代码说明:

  Compressed Sensing survey

文件列表:

Compressed Sensing.pdf, 495460 , 2013-03-22

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

发表评论

0 个回复

  • Simscape_PEV_Heat_dissipation
    本代码分析了插电式混合动力汽车充电时电流等参数对电池热量的影响,以及对充电参数的优化(This code analyses the influence of charging current and other parameters on battery heat of plug-in hybrid electric vehicle, as well as the optimization of charging parameters)
    2018-11-07 19:10:55下载
    积分:1
  • Form1.Designer
    说明:  sensor para sentir el amor de ella
    2020-06-24 20:20:01下载
    积分:1
  • stone_choice
    很小很经典的一个游戏——取石子,一次只允许取1到3的整数,最后取走石子的一方失败。(A small classic games- from stone, to allow only take a 1-3 integer, and finally took away the stones of one loser.)
    2008-12-26 15:22:54下载
    积分:1
  • 实现公司考勤管理、登记每个员工的作息时间。
    实现公司考勤管理、登记每个员工的作息时间。-achievement appraisal management companies to register each employee"s work schedule.
    2022-02-05 16:04:15下载
    积分:1
  • ads4449_config
    说明:  配置ADS4449,SPI接口;中文说明不能小于20字(Configure ads4449,Chinese description cannot be less than 20 words)
    2020-11-30 16:19:27下载
    积分:1
  • xth矩阵键盘 全
    用于扫描32矩阵键盘,是轮询模式。 不是中断模式。。。。(Used for 32 matrix keyboard scanning)
    2020-06-18 02:00:01下载
    积分:1
  • bpso-master
    离散的粒子群算法 是用 python写, 输入都是0和1(The discrete particle swarm optimization is written in Python, and the input is 0 and 1.)
    2021-03-29 23:19:10下载
    积分:1
  • s-
    说明:  C++大学基础教程,北京邮电大学电信工程学院,计算机技术中心(Essentials C++ University, Beijing University of Posts and Telecommunication Engineering, Computer Technology Center)
    2013-04-03 15:31:37下载
    积分:1
  • PSO_OPF
    一种有效的用粒子群算法求解OPF的算法。可以直接拿来用。(An effective particle swarm optimization (PSO) algorithm for OPF. It can be used directly.)
    2019-07-11 15:42:07下载
    积分:1
  • NEH.m
    1.NEH principle (1) the processing time of each workpiece on all machines is summed; the summed values are sorted from large to small; (2) first select the first workpiece (the longest processing time), with the second workpiece into the first workpiece before and after the two positions, calculate makespan, small is saved; (3) fix the sequence in the previous step, insert the next workpiece into the previous workpiece, and compare the smallest makespan and save it; (4) Repeat the previous step to arrive at the final result.
    2020-08-26 13:38:14下载
    积分:1
  • 696522资源总数
  • 104027会员总数
  • 45今日下载