登录
首页 » Windows_Unix » MINNDz

MINNDz

于 2009-12-04 发布 文件大小:8KB
0 220
下载积分: 1 下载次数: 4

代码说明:

  Multiple-Instance Nearest Neighbour with Distribution learner.

文件列表:

MINNDz.java

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

发表评论

0 个回复

  • Script Unpack Frimware Echolink Open Vu 9
    说明:  Script Unpack Frimware Echolink Open Vu 9
    2019-02-27 16:26:51下载
    积分:1
  • lfm-compressive-sensing
    LFM宽带雷达信号的多通道盲压缩感知模型研究,提出了一种压缩感知技术新方法(Lfm compressive sensing)
    2016-05-19 15:04:46下载
    积分:1
  • pca_img_compress.tar
    说明:  matlab 用PCA方法对图像进行压缩、还原(PCA method using matlab image compression, restore)
    2008-12-02 21:05:17下载
    积分:1
  • Daubechies_EZW
    Daubechies小波变换和嵌入式零树编码(EZW)C语言程序,非常有用(Daubechies wavelet transform and embedded zero-tree coding (EZW) C language program, very useful)
    2008-08-20 10:17:38下载
    积分:1
  • huffman
    Huffman编码,使用哈弗曼树生成前缀码,把输入的字符编码并把原字符解码(Huffman code and decode)
    2014-03-06 10:10:34下载
    积分:1
  • C语言 文件的
    文件的解压缩。添加文件unzip.h、unzip.cpp、zip.h、zip.cpp,调用对应函数进行压缩和解压。压缩格式为zip;压缩之后的文件可以用winrar等程序打开。(File decompression. Add file unzip.h, unzip.cpp, zip.h, zip.cpp, call the corresponding function for compression and decompression. Compression format is zip the file after compression can be opened by winrar.)
    2020-07-14 09:58:51下载
    积分:1
  • mentkal.1
    计算多重积分是蒙特卡罗方法的重要应用领域之一。本章着重介绍计算定积分的蒙特卡罗方法的各种基本技巧,而这些技巧在粒子输运问题中也是适用的(Calculation of multiple points is an important application of the Monte Carlo method, one of the areas. This chapter focuses on calculation of definite integral of the Monte Carlo method, a variety of basic skills, and these skills in particle transport problems are also applicable to)
    2020-12-04 13:09:24下载
    积分:1
  • EZW
    基于小波变换的图像压缩,使用EZW算法。(Image compression based on wavelet transform, using EZW algorithm.)
    2018-05-14 21:20:28下载
    积分:1
  • 一种无损图象算法,可用于珍贵图象的保存 calic
    一种无损图象压缩算法,可用于珍贵图象的保存.(A lossless image compression algorithm, can be used for the preservation of precious images.)
    2020-08-10 18:48:28下载
    积分:1
  • peakfinder
    This function quickly finds local peaks or valleys (local extrema) in a noisy vector using a user defined magnitude threshold to determine if each peak is significantly larger (or smaller) than the data around it. The problem with the strictly derivative based peak finding algorithms is that if the signal is noisy many spurious peaks are found.
    2021-03-12 19:39:25下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载