Designand Analysisof Fast Text Compression Basedon Quasi-Arithmetic Coding.
标签： Quasi-Arithmetic Compression Analysisof Designand
上传时间： 2013-12-11
上传用户：kelimu
Fast Fourier Transform using MPI libraries (Source Code)
标签： Transform libraries Fourier Source
上传时间： 2017-07-30
上传用户：manking0408
compuete the fast fourier transformation of the image. it is very fast compare than fourier transformation.
标签： fourier fast transformation the
上传时间： 2017-08-08
上传用户：zhaoq123
It is about soving sparse solution from linear system, simpel and fast.
标签： solution soving linear simpel
上传时间： 2013-12-22
上传用户：tedo811
It is fast sparse linear programming solver, with fast speeder.
标签： fast programming speeder sparse
上传时间： 2014-12-20
上传用户：kytqcool
Home made 4x3 keyboard library for PIC microcontrollers. Fast and simple.
标签： microcontrollers keyboard library simple
上传时间： 2017-08-17
上传用户：refent
wavelet transform for the prediction of the colorant in food product, wavelet transform in chemestry, theshold,CWT in electrochemestry signal
标签： transform wavelet prediction chemestry
上传时间： 2017-08-24
上传用户：xg262122
ICA算法提供fast ICA 算法 P.COMON的算法
上传时间： 2013-12-22
上传用户：jqy_china
This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by performance benchmarks on different platforms.
标签： implementation Cooley-Tukey describes efficient
上传时间： 2013-12-23
上传用户：netwolf
The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return without sorting the subarray. After the top-level call to quicksort returns, run insertion sort on the entire array to finish the sorting process.
标签： running advantage quicksort improved
上传时间： 2013-12-01
上传用户：梧桐
