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

Li-OV

  • Instead of finding the longest common subsequence, let us try to determine the length of the LCS.

    Instead of finding the longest common subsequence, let us try to determine the length of the LCS. 􀂄 Then tracking back to find the LCS. 􀂄 Consider a1a2…am and b1b2…bn. 􀂄 Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. 􀂄 Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn 􀂄 Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. 􀂄 Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.

    标签: the subsequence determine Instead

    上传时间: 2013-12-17

    上传用户:evil

  • MATLAB code to perform Monte Carlo simulation for getting price of an European swaption under the Li

    MATLAB code to perform Monte Carlo simulation for getting price of an European swaption under the Libor Market Model (LMM) framework.

    标签: simulation European swaption perform

    上传时间: 2014-11-30

    上传用户:shus521

  • 充电器方案,为SLA

    充电器方案,为SLA,NICd,NiMH和Li-Lon电池设计的充电器

    标签: SLA 充电器 方案

    上传时间: 2013-12-28

    上传用户:zhouli

  • 哈夫曼树又称最优二叉树

    哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。所谓树的带权路径长度,就是树中所有的叶结点的权值乘上其到根结点的路径长度(若根结点为0层,叶结点到根结点的路径长度为叶结点的层数)。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln),N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树,相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。

    标签: 二叉树

    上传时间: 2017-06-09

    上传用户:wang5829

  • VHDL implementation of the twofish cipher for 128,192 and 256 bit keys. The implementation is in li

    VHDL implementation of the twofish cipher for 128,192 and 256 bit keys. The implementation is in library-like form All needed components up to, including the round/key schedule circuits are implemented, giving the flexibility to be combined in different architectures (iterative, rolled out/pipelined etc). Manual in English is included with more details about how to use the components and/or how to optimize some of them. All testbenches are provided (tables, variable key/text, ECB/CBC monte carlo) for 128, 192 and 256 bit key sizes, along with their respective vector files.

    标签: implementation twofish cipher VHDL

    上传时间: 2017-06-25

    上传用户:王小奇

  • On the implementation and usage of SDPT3 – a Matlab software package for semidefinite-quadratic-li

    On the implementation and usage of SDPT3 – a Matlab software package for semidefinite-quadratic-linear programming, version 4.0

    标签: semidefinite-quadratic-li implementation software package

    上传时间: 2014-11-30

    上传用户:ayfeixiao

  • metricmatlab ch­ ¬ ng 4 Ma trË n - c¸ c phÐ p to¸ n vÒ ma trË n

    metricmatlab ch­ ¬ ng 4 Ma trË n - c¸ c phÐ p to¸ n vÒ ma trË n. 4.1 Kh¸ i niÖ m: - Trong MATLAB d÷ liÖ u ® Ó ® ­ a vµ o xö lý d­ íi d¹ ng ma trË n. - Ma trË n A cã n hµ ng, m cét ® ­ î c gä i lµ ma trË n cì n  m. §­ î c ký hiÖ u An  m - PhÇ n tö aij cñ a ma trË n An  m lµ phÇ n tö n» m ë hµ ng thø i, cét j . - Ma trË n ® ¬ n ( sè ® ¬ n lÎ ) lµ ma trË n 1 hµ ng 1 cét. - Ma trË n hµ ng ( 1  m ) sè liÖ u ® ­ î c bè trÝ trª n mét hµ ng. a11 a12 a13 ... a1m - Ma trË n cét ( n  1) sè liÖ u ® ­ î c bè trÝ trª n 1 cét.

    标签: metricmatlab 203 184 tr

    上传时间: 2017-07-29

    上传用户:来茴

  • OV8825

    OV8825是OV的800W摄像头芯片,支持BLC,AWB,可调整帧率,输出窗口大小等。

    标签: 8M sensor

    上传时间: 2015-03-08

    上传用户:zy2537194177

  • gooseeker爬虫工具

    垂直搜索(Vertical Search):也称为专业搜索,高速、海量和精确抓取是定题网络爬虫DataScraper的强项,每天24小时每周7天无人值守自主调度的周期性批量采集,加上断点续传和软件看门狗(Watch Dog),确保您高枕无忧 移动互联网:手机搜索、手机混搭(mashup)、移动社交网络、移动电子商务都离不开结构化的数据内容,DataScraper实时高效地采集内容,输出富含语义元数据的XML格式的抓取结果文件,确保自动化的数据集成和加工,跨越小尺寸屏幕展现和高精准信息检索的障碍。手机互联网不是Web的子集而是全部,由MetaSeeker架设桥梁 企业竞争情报采集/数据挖掘:俗称商业智能(Business Intelligence),噪音信息滤除、结构化转换,确保数据的准确性和时效性,独有的广域分布式架构,赋予DataScraper无与伦比的情报采集渗透能力,AJAX/Javascript动态页面、服务器动态网页、静态页面、各种鉴权认证机制,一视同仁。在微博网站数据采集和舆情监测领域远远领先其它产品。

    标签: 爬虫工具

    上传时间: 2015-03-21

    上传用户:bcr321

  • mapinfo

    数据库建立 数据库存储

    标签: 数据库

    上传时间: 2015-04-09

    上传用户:nfmhh