Abstract—We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space.
標(biāo)簽： technique operators Abstract describe
上傳時(shí)間： 2014-01-23
上傳用戶：ruixue198909
DSP2407比較全的源程序 包括SPI設(shè)計(jì)，AD,DA,ramtest， SCI,CAN，PWM,key,EXINT,24C02,VECTOR等
上傳時(shí)間： 2017-08-13
上傳用戶：aa54
ESRIMapObjectsLT 2 and MicrosoftVisual Basic6 to build an application that uses maps. Display a map with multiple layers. Control panning and zooming. Create a toolbar control. Base the display of map layers on scale. Perform spatial and logical queries. Display features with thematic renderers. Add vector data and images to a map programmatically.
標(biāo)簽： ESRIMapObjectsLT MicrosoftVisual application Display
上傳時(shí)間： 2013-12-18
上傳用戶：dbs012280
adhoc in c & c++ it hepls finding the shortest path among adhoc network . it provides advance protocols to find distence vector
標(biāo)簽： adhoc shortest provides finding
上傳時(shí)間： 2013-12-14
上傳用戶：rocketrevenge
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
標(biāo)簽： Implementation calculates algorithm Edmonds
上傳時(shí)間： 2014-01-04
上傳用戶：kiklkook
這個(gè)程序是實(shí)現(xiàn)人工智能中的A*算法，照著書(shū)上的算法做的。Queue類(lèi)是自己寫(xiě)的一個(gè)隊(duì)列類(lèi)，用來(lái)實(shí)現(xiàn)open表和closed表。原來(lái)用Vector做的，但后來(lái)發(fā)現(xiàn)Vector中保存的只是引用，生成子狀態(tài)后表中的狀態(tài)也跟著變了，只好自己實(shí)現(xiàn)一個(gè)隊(duì)列類(lèi)。
上傳時(shí)間： 2017-09-02
上傳用戶：xinzhch
Aodv for NS-2. A mobile ad-hoc network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers connected wirelessly. MANET may operate in a standalone fashion, or may be connected to the larger Internet. Many routing protocols have been developed for MANETs over the past few years. This project evaluated three specific MANET routing protocols which are Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET Ondemand routing protocol (DYMO) to better understand the major characteristics of these routing protocols. Different performance aspects were investigated in this project including packet delivery ratio, routing overhead, throughput and average end-to-end delay.
標(biāo)簽： network ad-hoc wireless mobile
上傳時(shí)間： 2014-01-12
上傳用戶：zsjzc
此程序主要查實(shí)現(xiàn)插入排序，過(guò)程為依次輸入集合A和B的元素，在一維數(shù)組space中建立表示集合(A-B)∪(B-A)
上傳時(shí)間： 2017-09-28
上傳用戶：jing911003
演算法評(píng)估 用空間和時(shí)間評(píng)估演算法效能 時(shí)間複雜度(Time Complexity) 空間複雜度(Space Complexity) 效能評(píng)估 效能分析(Performance Analysis)：事前評(píng)估 效能評(píng)估(Performance Measurement)：效能量測(cè) 評(píng)估時(shí)均假設(shè)處理的資料量為n到無(wú)窮大
標(biāo)簽： 演算
上傳時(shí)間： 2015-06-13
上傳用戶：18007270712
排序算法比較 快拍 選擇 堆排序 希爾排序 用了vector更容易看
標(biāo)簽： c++
上傳時(shí)間： 2015-06-28
上傳用戶：z1s2e3q
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
