CREATE GRAPH WITH NEW TECHNOLOGY OF DRAWING
标签: TECHNOLOGY DRAWING CREATE GRAPH
上传时间: 2017-08-21
上传用户:6546544
Browser-based (HTTP) file uploading is a great way to transfer arbitrary files from a client machine to the Web server which adds another dimension to Web-based applications.
标签: Browser-based arbitrary uploading transfer
上传时间: 2017-08-21
上传用户:13188549192
Neural Network Based Threshold Determination for Malaysia License Plate Character Recognition
标签: Determination Recognition Character Threshold
上传时间: 2017-08-22
上传用户:l254587896
AT91SAM9263 code for I2C based ADC and DAC
上传时间: 2017-08-23
上传用户:change0329
Fundamental to advance image processing: basic image, multiscale, and 3D representation based alot on random variables and neighborhood operation
标签: image representation Fundamental processing
上传时间: 2017-08-24
上传用户:标点符号
a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded systems. All crypto protocols require the generation and use of secret values that must be unknown to attackers.Random number generators (RNG) are required to generate public/private key pairs for asymmetric algorithm such as RSA and symmetric algorithm such as AES.
标签: FPGA-based generator embedded hardware
上传时间: 2014-01-09
上传用户:一诺88
A short-time Fourier transform based symbol timing approach for OFDM systems
标签: short-time transform approach Fourier
上传时间: 2013-12-13
上传用户:playboys0
FPGA Based RFID Reader for 125KHz and 134.2Khz Final Presentation
标签: Presentation Reader Based 134.2
上传时间: 2013-12-09
上传用户:123456wh
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
标签: Implementation calculates algorithm Edmonds
上传时间: 2014-01-04
上传用户:kiklkook
Implementations of a queue in C with algoritmo BFS, that calculates the minimum distance in a graph.
标签: Implementations calculates algoritmo distance
上传时间: 2017-08-26
上传用户:z754970244