I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performance of the three implementations.
標(biāo)簽： implement algorithm Dijkstra Shortest
上傳時(shí)間： 2014-01-01
上傳用戶：BIBI
LED顯示，查表讀碼值。B、F、A、E、 D、dp、C、G為讀碼順序
標(biāo)簽： LED
上傳時(shí)間： 2017-09-17
上傳用戶：壞壞的華仔
LAND COVER CLASSIFICATION OF RURAL AREAS USING LIDAR DATA: A COMPARATIVE STUDY IN THE CONTEXT OF FIRE RISK
標(biāo)簽： CLASSIFICATION COMPARATIVE CONTEXT COVER
上傳時(shí)間： 2017-09-17
上傳用戶：小寶愛考拉
This book is intended to be a complete and useful reference to the unified modeling language (UML) for the developer,architect,project manager,sysetem engineer,programmer,analyst,contracting officer,customer,and anyone else who needs to specify,design,build,or understand complex software system.
標(biāo)簽： reference intended complete modeling
上傳時(shí)間： 2017-09-24
上傳用戶：eclipse
This source code show you how to implement the FFT algorithm in c.details please referent my fft.c file.
標(biāo)簽： algorithm implement referent details
上傳時(shí)間： 2014-02-25
上傳用戶：yulg
用AT89S51的并行口P1接4×4矩陣鍵盤，以P1.0－P1.3作輸入線，以P1.4－P1.7作輸出線；在數(shù)碼管上顯示每個(gè)按鍵的“0－F”序號(hào)。
上傳時(shí)間： 2014-12-22
上傳用戶：zhuyibin
本論文研究了開源路由器的實(shí)現(xiàn)方法，通過具體的實(shí)驗(yàn)在X O R P 上實(shí)現(xiàn)了R I P , O S P F , B G P 等一系列協(xié)議，在P A C K E T T R A C E R 上進(jìn)行了仿真，并對(duì)開源路由器進(jìn)行了性能評(píng)價(jià)。
標(biāo)簽： 開源路由器
上傳時(shí)間： 2015-02-21
上傳用戶：13666909595
本論文研究了開源路由器的實(shí)現(xiàn)方法，通過具體的實(shí)驗(yàn)在X O R P 上實(shí)現(xiàn)了R I P , O S P F , B G P 等一系列協(xié)議，在P A C K E T T R A C E R 上進(jìn)行了仿真，并對(duì)開源路由器進(jìn)行了性能評(píng)價(jià)。
標(biāo)簽： 開源路由器
上傳時(shí)間： 2015-02-21
上傳用戶：13666909595
電子設(shè)計(jì)大賽A.正弦信號(hào)發(fā)生器 B.集成運(yùn)放測試儀 C.簡易頻譜分析儀 D.單工無線呼叫系統(tǒng) E.懸掛運(yùn)動(dòng)控制系統(tǒng) F.數(shù)控恒流源 G.三相正弦波變頻電源
標(biāo)簽： 電賽
上傳時(shí)間： 2015-03-03
上傳用戶：月半情殤
The object detector described below has been initially proposed by P.F. Felzenszwalb in [Felzenszwalb2010]. It is based on a Dalal-Triggs detector that uses a single filter on histogram of oriented gradients (HOG) features to represent an object category. This detector uses a sliding window approach, where a filter is applied at all positions and scales of an image. The first innovation is enriching the Dalal-Triggs model using a star-structured part-based model defined by a “root” filter (analogous to the Dalal-Triggs filter) plus a set of parts filters and associated deformation models. The score of one of star models at a particular position and scale within an image is the score of the root filter at the given location plus the sum over parts of the maximum, over placements of that part, of the part filter score on its location minus a deformation cost easuring the deviation of the part from its ideal location relative to the root. Both root and part filter scores are defined by the dot product between a filter (a set of weights) and a subwindow of a feature pyramid computed from the input image. Another improvement is a representation of the class of models by a mixture of star models. The score of a mixture model at a particular position and scale is the maximum over components, of the score of that component model at the given location.
標(biāo)簽： 計(jì)算機(jī)視覺
上傳時(shí)間： 2015-03-15
上傳用戶：sb_zhang
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
