Mathimatics-Numerical algorithms List Page 28185

Mathimatics-Numerical algorithms list

Sort by ：

« 1 2 ... .80 .81 .82 .83 .84 28185.86 .87 .88 .89 .90 ... 28522 »

20071122242959744 Downloaded：0: A good system design, detailed and accurate understanding of the illustrated
Update : 2008-10-13 Size : 60.39kb Publisher : liuygxi
2007fs-svm Downloaded：0: New vector machine SVM source, IEEE published, technology has certainly helped
Update : 2008-10-13 Size : 141.67kb Publisher : wang
longbeigejifen Downloaded：0: With c++ Prepared Romberg integration process with examples and calculation results
Update : 2008-10-13 Size : 1002byte Publisher : 叫怎高
juzhendiedai Downloaded：0: Use c++ Matrix prepared iterative algorithm, which contains the Jacobi method and Gauss- Seidel method
Update : 2008-10-13 Size : 1.3kb Publisher : 叫怎高
diedai Downloaded：0: With c++ Prepared a simple iterative Newton-fat and fat as well as Aitken plus the entire convergence law effective procedures
Update : 2008-10-13 Size : 1.72kb Publisher : 叫怎高
20070707-165713 Downloaded：0: LSB information hiding algorithm, the information is usually hidden in the image pixels of the last one, you may have to help
Update : 2008-10-13 Size : 1.79kb Publisher : jonin
Blackfin_JPEG2000 Downloaded：0: JPEG2000 ADI BLACKFIN compression decompression procedures
Update : 2008-10-13 Size : 847.25kb Publisher : 李志
Blackfin_SpeechAudio Downloaded：0: ADI BLACKFIN BF533 procedures of the audio codec
Update : 2008-10-13 Size : 913.08kb Publisher : 李志
Blackfin_Mpeg_2_4 Downloaded：0: adi blackfin decompress compressed image mpeg4
Update : 2008-10-13 Size : 608.63kb Publisher : 李志
dituzhese Downloaded：0: Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cit
Update : 2008-10-13 Size : 405.59kb Publisher : 杜丹
bmpchangejpg Downloaded：0: bmp into jpg is compressed Oh! 111 111
Update : 2008-10-13 Size : 1.49kb Publisher : ben
beibao Downloaded：0: 0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the
Update : 2008-10-13 Size : 1.18kb Publisher : 杜丹

« 1 2 ... .80 .81 .82 .83 .84 28185.86 .87 .88 .89 .90 ... 28522 »

Search in result