TO APPROXIMATE I = INTEGRAL((F(X) DX)) FROM A TO B:
INPUT: ENDPOINTS A, B; INTEGER N.
OUTPUT: AN ARRAY R. ( R(2,N) IS THE APPROXIMATION TO I.)
R IS COMPUTED BY ROWS; ONLY 2 ROWS SAVED IN STORAGE... AlgorithmFortran
KMEANS uses a two-phase iterative algorithm to minimize the sum of point-to-centroid distances, summed over all K clusters. The first phase uses what the literature often describes as "batch" updates, where each iteration consists of reassigning points to their nearest cluster centroid, all at... AlgorithmMatlab
With c++ achieved has Ant group algorithm; with c++ achieved has Ant group algorithm; with c++ achieved has Ant group algorithm; with c++ achieved has Ant group algorithm; with c++ achieved has Ant group algorithm; with c++ achieved has Ant group algorithm; with c++ achieved has Ant group algorithm;... AlgorithmC++
Ant (Ant Colony Optimization, ACO), also known as Ant algorithm Are used in the map to find optimal path algorithm for the chance of. By Marco Dorigo in 1992 in his PhD thesis proposed that inspired behavior discovering the path of the ants in search of food. Ant Colony algorithm is a simulation of... AlgorithmMatlab
In 31 cities, with genetic algorithm for solving TSP problems, gives the source program. You can run!
Genetic algorithm is to mimic biological evolution and natural selection mechanisms, simulation of bio-genetic and evolutionary processes in the environment to form an adaptive search algorithm... AlgorithmC
The Ford–Fulkerson method is an algorithm which computes the maximum flow in a flow network. It was published in 1956 by L. R. Ford, Jr. and D. R. Fulkerson. The name "Ford–Fulkerson" is often also used for the Edmonds–Karp algorithm,... AlgorithmMatlab
Surf algorithm is an improvement of the Sift algorithm, primarily on the algorithm execution efficiency than Sift algorithm runs faster!
1, algorithm theory; 2, source analysis; 3, OpenCV Demo analysis; 4, some Surf algorithm analysis.... AlgorithmC++
It is well-known that good initializations can improve the speed and accuracy of the solutions of
many nonnegative matrix factorization (NMF) algorithms . Many NMF algorithms are sensitive
with respect to the initialization of W or H or both. This is especially true of algorithms of the
Digital Signature algorithm implementation:
Its an encryption scheme technique to generate a signature.It contain 4 algorithms.First algorithm for generation of large prime number, second algorithm generates key, third algorithm implements the SHA-1 and fourth algorithm generates the sign... AlgorithmC
Graphics learn in the painting line, painting round, polygon, segment cropped, painting curve, this program is based on window of, painting line including DDA,Midpoint,bresenham painting line method, midpoint painting round, polygon scan line algorithm, regional fills algorithm, segment cropped Cohe... AlgorithmC++
Three on synthetic aperture radar imaging algorithm, the development environment is MATLAB, suitable for novice to learn to use. Three on synthetic aperture radar imaging algorithm, the development environment is MATLAB, suitable for novice to learn to use. Three on synthetic aperture radar imaging... AlgorithmMatlab
The SLl0 algorithm is a new algorithms for compressed sensing reconstruction of sparse, approximation by smooth functions such as using Gaussian function 0-norm optimization problems in compressed sensing, NP problems into smooth convex optimization problems. According to my tests, SL0 algorithm to... AlgorithmMatlab