Lecture Notes on Probability Theory
標(biāo)簽： Probability Lecture Theory Notes
上傳時間： 2013-12-12
上傳用戶：hn891122
usb_cpld_code.zip usbjtag - Variations on the implementation of a USB JTAG adapter.
標(biāo)簽： implementation usb_cpld_code Variations adapter
上傳時間： 2013-12-29
上傳用戶：aysyzxzm
something useful for communication,source code based on FPGA
標(biāo)簽： communication something useful source
上傳時間： 2015-08-15
上傳用戶：xfbs821
calculatePXTheta---Calculate the probability of each pixel being its color conditioned on all of the clusters that were found at the previous (coarser) iteration.
標(biāo)簽： calculatePXTheta probability conditioned Calculate
上傳時間： 2013-12-24
上傳用戶：lyy1234
Media transfer protocol implementation on POSIX. Have detailed readme on how to move to windows
標(biāo)簽： implementation transfer protocol detailed
上傳時間： 2013-12-19
上傳用戶：diets
A-Moving-Object-Database-Model-Based-on-Road-NetWork一種基于道路網(wǎng)絡(luò)的移動目標(biāo)數(shù)據(jù)庫模型
標(biāo)簽： A-Moving-Object-Database-Model-Ba sed-on-Road-NetWork 道路網(wǎng)絡(luò) 移動
上傳時間： 2014-01-01
上傳用戶：klin3139
Cracking the Code - Wireless Programming with J2ME This book is based on the unique concept of cracking the code and mastering the technology.The technologies covered are J2ME version 1.0.2 and the applications are also tested on version 1.0.3 Beta.
標(biāo)簽： Programming the Cracking Wireless
上傳時間： 2015-08-20
上傳用戶：fhzm5658
waveform and receiver design considerations on wideband CDMA 寬帶CDMA系統(tǒng)的波形和接收機(jī)設(shè)計
標(biāo)簽： CDMA considerations waveform receiver
上傳時間： 2015-08-20
上傳用戶：源碼3
A tutorial on hidden Markov models and selected applications 是個英文資料 很不錯的
標(biāo)簽： applications tutorial selected hidden
上傳時間： 2014-01-27
上傳用戶：zsjzc
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標(biāo)簽： introduction the contains intended
上傳時間： 2013-12-23
上傳用戶：liansi
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
