4. If a modified source code is distributed, the original unmodified -- source code must also be included (or a link to the Free IP web -- site). In the modified source code there must be clear -- identification of the modified version.
标签： source code distributed unmodified
上传时间： 2013-12-14
上传用户：qq1604324866
Locally weighted polynomial regression LWPR is a popular instance based al gorithm for learning continuous non linear mappings For more than two or three in puts and for more than a few thousand dat apoints the computational expense of pre dictions is daunting We discuss drawbacks with previous approaches to dealing with this problem
标签： polynomial regression weighted instance
上传时间： 2013-11-28
上传用户：sunjet
一个很好用的增强的Timer库（可以取代VB的Timer控件）.
上传时间： 2014-01-20
上传用户：569342831
这是一个测试Timer类用法的程序.程序会随机产生10个时间， 并在时间到的时候出发Task类对象中的run方法
上传时间： 2015-03-21
上传用户：wl9454
A simple C program to strobe the LEDsvia Port D. The strobe rate is to be set by adjusting the voltage drop over a potentiometer that is sampled by an ADC.
上传时间： 2014-01-09
上传用户：lifangyuan12
本程序通过对研祥EVOC_PCL813高速A/D数据采集卡的驱动，采集40路模拟通道的数据，并以数据文件的形式存储在硬盘上，生成文本文件
上传时间： 2014-01-03
上传用户：guanliya
用图形界面实现Timer，可以设置时间段，可以关闭和启动Timer用任意键完成。
上传时间： 2014-09-10
上传用户：金宜
This is a program that will let you calculate roots with the Quadratic formula (including complex roots), Factorial of a number, Fibonacci series (and Pascals Triangle still under construction).
标签： Quadratic calculate including formula
上传时间： 2014-01-25
上传用户：zhuoying119
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
标签： initiated described modified slightly
上传时间： 2014-01-09
上传用户：sk5201314
In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
标签： algorithm character position either
上传时间： 2014-01-27
上传用户：wang0123456789
