<li id="4k8k8"></li> <li id="4k8k8"></li>
<rt id="4k8k8"></rt>
this the source code of audio compression standard LPC. It is coded by C.
標(biāo)簽： C. compression standard source
上傳時(shí)間： 2016-01-07
上傳用戶：helmos
1.Xvid Mpeg4 1.13 version 2.Building 0 error(s), 0 warning(s) By Jesse Stone Taiwan
標(biāo)簽： Building version warning Taiwan
上傳時(shí)間： 2016-01-08
上傳用戶：yulg
An Overview of the Coherent Acoustics Coding System(by Mike Smyth) 一本講DTS編碼細(xì)節(jié)的書,深入淺出
標(biāo)簽： Acoustics Overview Coherent Coding
上傳時(shí)間： 2014-01-26
上傳用戶：懶龍1988
show 0-F cycle by cycle in ARM7
上傳時(shí)間： 2016-01-11
上傳用戶：yph853211
keil study book by chen yi fan
標(biāo)簽： study keil book chen
上傳時(shí)間： 2013-12-23
上傳用戶：er1219
*水季JSP環(huán)境探針 v1.1 * *Copyright (C) 2005 by 水季 * *E-mail:water-season@sohu.com * *QQ:176291935 * *http://bbs.iaiai.com * *------------------------------------------------------------------------------------* *警告:請(qǐng)不要隨便修改以上版權(quán)信息! *
標(biāo)簽： water-season Copyright 176291935 E-mail
上傳時(shí)間： 2013-12-17
上傳用戶：410805624
一段HSV、RGB相互轉(zhuǎn)換的代碼，看來應(yīng)該是簡化算法
標(biāo)簽： HSV RGB 轉(zhuǎn)換 代碼
上傳時(shí)間： 2016-01-13
上傳用戶：cainaifa
Microsoft.NET測(cè)試驅(qū)動(dòng)開發(fā) Test-Driven Development in Microsoft .NET by James W. Newkirk and Alexei A. Vorontsov ISBN:0735619484 Microsoft Press © 2004 Using a wealth of pragmatic examples in C# and other .NET development tools, the two authors of this text demonstrate how to use automated tests to drive lean, efficient coding and better design.
標(biāo)簽： Microsoft A. W. Development
上傳時(shí)間： 2014-01-07
上傳用戶：ynzfm
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶：jeffery
winsocket 開發(fā)指南,Java sockets 101 Presented by developerWorks, your source for great tutorials
標(biāo)簽： developerWorks winsocket Presented tutorials
上傳時(shí)間： 2013-12-22
上傳用戶：ryb
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
<rt id="qwgsg"></rt>