Search - INT 1 - CodeBus

Search - INT 1 - List

[Graph Recognize] K-means算法源码 DL : 0: kmeans This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter>
Date : 2008-10-13 Size : 3.42kb User : li
[Graph Recognize] 2D DL : 0: C code for \"Computational Geometry in C (Second Edition)\": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Date : 2008-10-13 Size : 66.29kb User : Mark
[Graph Recognize] K-means算法源码 DL : 0: kmeans This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> -kmeans This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat- Number of patterns (int) SizeVect- Size of vector (int) NClust- Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect]- vector 1 (real) vect[2,1] ... vect[2,SizeVect]- vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter>
Date : 2026-01-07 Size : 3kb User : li
[Graph Recognize] 2D DL : 0: C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm-C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Date : 2026-01-07 Size : 66kb User : Mark
[Graph Recognize] AspriseOCRv4 DL : 0: 英文OCR识别控件，可对验证码进行识别。带有演示源码。 int startX = 0 int startY = 0 int width = -1 int height = -1 try { startX = Convert.ToInt32(textStartX.Text) startY = Convert.ToInt32(textStartY.Text) width = Convert.ToInt32(textWidth.Text) height = Convert.ToInt32(textHeight.Text) } catch (Exception ex) { Console.WriteLine(ex.StackTrace) } String result = Marshal.PtrToStringAnsi(OCRpart(textImage.Text, -1, startX, startY, width, height)) textResults.Text = result -English OCR recognition controls, can be identified on the Verification Code. Demonstration with source code. int startX = 0 int startY = 0 int width =-1 int height =-1 try (startX = Convert.ToInt32 (textStartX.Text) startY = Convert.ToInt32 (textStartY.Text) width = Convert. ToInt32 (textWidth.Text) height = Convert.ToInt32 (textHeight.Text) ) catch (Exception ex) (Console.WriteLine (ex.StackTrace) ) String result = Marshal.PtrToStringAnsi (OCRpart (textImage.Text,-1 , startX, startY, width, height)) textResults.Text = result
Date : 2026-01-07 Size : 5.13mb User : King
[Graph Recognize] wujiaoxing DL : 0: 用API函数编写一个五角星，五条线相接，并且填充不同颜色-long WINAPI WndProc(HWND hWnd,UINT iMessage, UINT wParam,LONG lParam) BOOL InitWindowsClass(HINSTANCE hInstance) BOOL InitWindows(HINSTANCE hInstance,int nCmdShow) int WINAPI WinMain(HINSTANCE hInstance,HINSTANCE hPrenInstance,LPSTR lpCmdLin,int nCmdShow)
Date : 2026-01-07 Size : 1kb User : gaoying
[Graph Recognize] kartrider DL : 0: 跑跑卡丁车 ★实验任务有 n 辆卡丁车车牌号分别为 1，2，…，n 在高速公路上竞速。Coffee 是位跑跑卡丁车爱好者，她在比赛的过程中拍摄了两张照片，在照片上可以清晰的看到每辆车的的车牌号。给出两张照片上从第一名到最后一名的车牌号，请你编程计算这两张照片的拍摄时间段内至少发生了几次超车。 ★数据输入输入第一行包括一个正整数 n（1<=n<=50000），表示卡丁车数量。接下来两行，每行包括 n 个整数，表示照片上从第一名到最后一名的车牌号（1 到 n 的全排列），每两个数之间用一个空格隔开。 ★数据输出输出仅有一个数，即至少发生的超车次数，答案在 int 型范围内。-KartRider ★ experimental tasks Kart n vehicle license plate number are respectively 1,2, ..., n racing on the highway. Coffee is a KartRider love Well is the course of the game she shot two photos in the photo can clearly see each vehicle s license plate number. Shows two photographs from the first to the last one on the license plate number, please calculate your programming time period these two photos were taken Occurred at least several overtaking. ★ data input Enter the first line contains a positive integer n (1 <= n <= 50000), said the number of karting. The next two lines, each line Including the n integers, said the photo first to the last one from the license plate number (1 to n the full array), each of the two numbers Separated by a space between. ★ data output Output is only one number, that at least the number of overtaking occurred, the answer is in the range of int type.
Date : 2026-01-07 Size : 65kb User : 张泉
[Graph Recognize] damaAPI DL : 0: C++: usin接口说明: void setSoftInfo(int softId,char* softKey) /** 目的: 设置软件信息参数列表： int softId 软件id char* softKey 软件的key 返回值：无 */-C++: usin Interface Description: the void setSoftInfo (the int SoftID, char* Softkey) /** Purpose: setup software parameter list: the the int SoftID software id char* Softkey software key return value: None* /
Date : 2026-01-07 Size : 109kb User : 王刚
[Graph Recognize] Match-point-correlation-coefficient DL : 1: 相关系数法的点匹配 void draw(int x,int y,Mat mat,Mat mod,int xx,int yy)通过十字丝表明匹配点 void ImgMarch(Mat s,Mat m,Mat roi,int x,int y)相关系数法匹配函数-Match point correlation coefficient method void draw (int x, int y, Mat mat, Mat mod, int xx, int yy) indicate the matching points by crosshairs void ImgMarch (Mat s, Mat m, Mat roi, int x, int y) correlation coefficient matching function
Date : 2026-01-07 Size : 14mb User : zhaobofei