虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

TV-Tree

  • ) Compression using huffman code -with a number of bits k per code word -provide huffma

    ) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.

    标签: code Compression huffman provide

    上传时间: 2017-05-30

    上传用户:yuchunhai1990

  • The emphasis of this book is on real-time application of Synopsys tools, used to combat various pro

    The emphasis of this book is on real-time application of Synopsys tools, used to combat various problems seen at VDSM geometries. Readers will be exposed to an effective design methodology for handling complex, submicron ASIC designs. Significance is placed on HDL coding styles, synthesis and optimization, dynamic simulation, formal verification, DFT scan insertion, links to layout, physical synthesis, and static timing analysis. At each step, problems related to each phase of the design flow are identified, with solutions and work-around described in detail. In addition, crucial issues related to layout, which includes clock tree synthesis and back-end integration (links to layout) are also discussed at length. Furthermore, the book contains in-depth discussions on the basics of Synopsys technology libraries and HDL coding styles, targeted towards optimal synthesis solution.

    标签: application real-time Synopsys emphasis

    上传时间: 2017-07-05

    上传用户:waitingfy

  • JXMLEditor is a XML editor developed in Java which is based on the Xerces Java parser. The goal of t

    JXMLEditor is a XML editor developed in Java which is based on the Xerces Java parser. The goal of this editor is to offer some features (tree view, drag & drop, syntax colorizing) to create XML documents easily. Also available as Eclipse Plugin.

    标签: Java JXMLEditor developed editor

    上传时间: 2013-11-30

    上传用户:水口鸿胜电器

  • Abtract - We propose a new family of fi lter banks, named NDFB, that can achieve the direction

    Abtract - We propose a new family of fi lter banks, named NDFB, that can achieve the directional decomposition of arbitrary N-dimensional (N ≥ 2) signals with a simple and effi cient tree-structured construction.

    标签: direction Abtract propose achieve

    上传时间: 2014-01-15

    上传用户:凤临西北

  • Omap2420适合基于Linux、Windows和Symbian操作系统(OS)的高端手机应用。它是Omap 2系列产品中的第一款

    Omap2420适合基于Linux、Windows和Symbian操作系统(OS)的高端手机应用。它是Omap 2系列产品中的第一款,而Omap2系列最终将会转向“调制解调和应用处理器”的混合领域。或许这款芯片最吸引人的地方就是多处理器内核,它包含了330MHz的ARM 11 RISC、220 MHz的TI C55 DSP、内含ARM7的成像和视频处理器,以及支持166 MHz移动DDR SDRAM的Imagination Technologies公司3-D图形处理器。该芯片还集成了显示和相机控制器、SDRAM和闪存控制器,并附加了60多个外围控制器。Omap 2420能够为高端多媒体应用提供强大支持,这些应用包括30fps通用中间格式(CIF)的视频会议、30fps的VGA编解码、VGA和TV显示,以及300万像素以上的相机。使用该芯片的手机设计已经进行了一段时间,估计马上就会投放市场

    标签: Omap Windows Symbian Linux

    上传时间: 2017-08-06

    上传用户:agent

  • 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Grap

    此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。 tubao用递归法解决突包问题

    标签: Boyer_Moore Horspool Grap AVL

    上传时间: 2017-08-08

    上传用户:佳期如梦

  • 13、堆 MinHeap.h test.cpp 14、哈夫曼树 BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.

    13、堆 MinHeap.h test.cpp 14、哈夫曼树 BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.cpp 15、树 164 QueueNode.h LinkQueue.h TreeNode.h Tree.h 170 test.cpp 16、B+树 BTreeNode.h BTree.h 192 test.cpp 17、图 217 MinHeap.h Edge.h 222 Vertex.h Graph.h 224 test.cpp 18、排序 Data.h 249 QueueNode.h LinkQueue.h Sort.h 263 test.cpp

    标签: MinHeap BinTreeNode BinaryTree Huffman

    上传时间: 2017-08-14

    上传用户:AbuGe

  • 函数程序设计haskell的作业

    函数程序设计haskell的作业,实现一个抽象数据类型tree模块

    标签: haskell 函数 程序设计

    上传时间: 2017-08-16

    上传用户:王小奇

  • The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of cla

    The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of possible classes is finite. Only tests, that split the set of instances of the underlying example languages depending on the value of a single attribute are supported.

    标签: algorithm induction decision top-down

    上传时间: 2017-08-20

    上传用户:hzy5825468

  • 随着家用电器种类的增多

    随着家用电器种类的增多, 遥控器的种类也随之增多, 由于不同种类的遥控器不能相互代替, 这给人们的生活带来些不便.若能有一种万能遥控器, 它可同时控制不同类型的TV、 VCR、CBL、DVD、VCD、AMP、CD、TAPE、TUNER等, 并且价格与现在的专用遥控器价格相当, 这将方便人们的生活, 改善人们的生活素质.

    标签: 家用电器

    上传时间: 2014-01-07

    上传用户:CSUSheep