Traffic sign shape classification based on Support Vector Machines and the FFT of the signature of blobs.pdf
標簽： classification the signature Machines
上傳時間： 2013-12-14
上傳用戶：rishian
WMTSA toolbox is an implemenation for MATLAB of the wavelet methods for time series analysis techniques presented in: Percival, D. B. and A. T. Walden (2000) Wavelet Methods for Time Series Analysis. Cambridge: Cambridge University Press.
標簽： implemenation for analysis toolbox
上傳時間： 2014-01-15
上傳用戶：huangld
This program is a simple Measurement Recorder. It is based on the LPC CPU and records the state of Port 1 and Port 2
標簽： Measurement the Recorder program
上傳時間： 2016-08-17
上傳用戶：dreamboy36
state of art language modeling methods: An Empirical Study of Smoothing Techniques for Language Modeling.pdf BLEU, a Method for Automatic Evaluation of Machine Translation.pdf Class-based n-gram models of natural language.pdf Distributed Language Modeling for N-best List Re-ranking.pdf Distributed Word Clustering for Large Scale Class-Based Language Modeling in.pdf
標簽： Techniques Empirical Smoothing Language
上傳時間： 2016-12-26
上傳用戶：zhuoying119
漢諾塔！！！ Simulate the movement of the Towers of Hanoi puzzle Bonus is possible for using animation eg. if n = 2 A→B A→C B→C if n = 3 A→C A→B C→B A→C B→A B→C A→C
標簽： the animation Simulate movement
上傳時間： 2017-02-11
上傳用戶：waizhang
Description The art galleries of the new and very futuristic building of the Center for Balkan Cooperation have the form of polygons (not necessarily convex). When a big exhibition is organized, watching over all of the pictures is a big security concern. Your task is that for a given gallery to write a program which finds the surface of the area of the floor, from which each point on the walls of the gallery is visible. On the figure 1. a map of a gallery is given in some co-ordinate system. The area wanted is shaded on the figure 2.
標簽： Description futuristic galleries the
上傳時間： 2017-02-17
上傳用戶：1427796291
Instead of finding the longest common subsequence, let us try to determine the length of the LCS. Then tracking back to find the LCS. Consider a1a2…am and b1b2…bn. Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
標簽： the subsequence determine Instead
上傳時間： 2013-12-17
上傳用戶：evil
A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
上傳時間： 2013-12-23
上傳用戶：it男一枚
Run RGB Video and watch the R-G-B Video Components parralel to the original Video
標簽： Video Components the parralel
上傳時間： 2017-05-07
上傳用戶：xmsmh
A 8 puzzle program solver.user have to input the current state and goal state of your 8 puzzle and it solving by the program.
上傳時間： 2014-08-10
上傳用戶：huyiming139
