数字高频头的驱动程序,对做DVD,TV的开发人员是好的例子
上传时间： 2013-12-22
上传用户：894898248
THE DECISION TREE ALGORITHM USED VC
标签： ALGORITHM DECISION TREE USED
上传时间： 2014-08-10
上传用户：1051290259
MS Press - Programming Microsoft DirectShow for Digital Video & TV
标签： Programming DirectShow Microsoft Digital
上传时间： 2013-12-19
上传用户：四只眼
B-TREE文件索引源代码,快速,高效的数据文件索引程序.
上传时间： 2013-12-29
上传用户：nanfeicui
Deleting a node of RB-Tree without recurrence
标签： recurrence Deleting RB-Tree without
上传时间： 2015-05-05
上传用户：yuzsu
采用总变分法（TV）进行图像修复的matlab源代码。包括热扩散修复和多尺度方法。
上传时间： 2015-05-06
上传用户：xlcky
TV自动搜台程序流程,可用于各种电视TUNER几各地区
上传时间： 2014-01-17
上传用户：ouyangtongze
基于内容的多媒体数据库检索算法： 用于最近邻搜索的R*-tree算法
上传时间： 2015-05-18
上传用户：13517191407
基于内容的多媒体数据检索算法SR-Tree，类似于R*-tree和SS-tree的最近邻搜索
上传时间： 2015-05-18
上传用户：缥缈
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
标签： available libraries Although nearly
上传时间： 2014-01-22
上传用户：zhoujunzhen
