代码搜索结果

[Main] gnugk_host=192.168.1.94 gnugk_port=7000 listen_port=7001 distribution_algorithm=LONGEST_IDLE logfile=acd.log debug=3 wq_start_cmd=start wq_portrange_start=1720 support_wq_message=hi_

/* Author: Pate Williams (c) 1997 Berlekamp's Q-matrix algorithm. See "Handbook of Applied Cryptography" by Alfred J. Menezes et al 3.11.2 Section 3.111 Algorithm page 124. Also see

// Fig. 23.26: Fig23_26.cpp // Standard Library algorithms fill, fill_n, generate and generate_n. #include using std::cout; using std::endl; #include // algorithm definit

/* Author: Pate Williams (c) 1997 Berlekamp's Q-matrix algorithm. See "Handbook of Applied Cryptography" by Alfred J. Menezes et al 3.11.2 Section 3.111 Algorithm page 124. Also see

% Algorithm 11.6. % The projective reconstruction algorithm from two views % as described in Chapter 5, "An introduction to 3-D Vision" % by Y. Ma, S. Soatto, J. Kosecka, S. Sastry (MASKS) % Code

% Algorithm 11.6. % The projective reconstruction algorithm from two views % as described in Chapter 6 and 11, "An introduction to 3-D Vision" % by Y. Ma, S. Soatto, J. Kosecka, S. Sastry (MASKS)

"Function","GJ_step","(Mat, [Typ], [IntValue]) ","Gauss-Jordan algorithm step by step","Linear Algebra","Gauss-Jordan algorithm step by step",,"matrix","matrix.hlp","21" "Function","M_ABS","(v) ","No

//Graham scan algorithm //O(nlgn) # include # include # include # define MAX 50001 using namespace std; typedef int stack; struct node { int x, y; }Q[MAX

//Graham scan algorithm //O(nlgn) # include # include # include # define MAX 50001 using namespace std; typedef int stack; struct node { int x, y; }Q[MAX

//Graham scan algorithm //O(nlgn) # include # include # include # define MAX 50001 using namespace std; typedef int stack; struct node { int x, y; }Q[MAX