arima algorithm

BF (Brute force) algorithm is the normal pattern matching algorithm, the idea of BF algorithm is to match the first character of the target string s with the first character of the pattern string T, if equal, continue to compare the second character of S and the second character of T, if not equal, compare the second character of S with the first character of T,

First, greedy algorithm introductionThe basic idea of the algorithm: from one of the initial solution of the problem to proceed step by step, according to an optimization measure, each step must ensure that the local optimal solution can be obtained. Each step considers only one data, and his selection should satisfy the conditions of local optimization. If the next data and part of the optimal solution are

These weeks began the formal systematic study of graph theory, the new semester began a new record. Since the two-mode and biological geography of the two college entrance examination near, time is relatively hasty, so temporarily skip the graph theory of (a) and (ii), that is, the storage and traversal of the graph. From the shortest Path algorithm learning, the first thing to learn is the Floyed-warshall algorithm.Floyed (Freud)

advance, Simhash is essentially a kind of lsh. Because of its local sensitivity (this section of local sensitivity refers to very similar text, even if only one character, the sequence after the MD5 may be very different, but the sequence after Simhash may be only a few different), so we can use the Hamming distance to measure the similarity of the Simhash value.Simhash is the algorithm that Google uses to handle massive text-to-weight. Google produc

"Machine Learning Algorithm Implementation" series of articles will record personal reading machine learning papers, books in the process of the algorithm encountered, each article describes a specific algorithm, algorithm programming implementation, the application of practical examples of the

Content: How to deal with tasks that cannot be accomplished; problem with no fast algorithm (NP-complete problem) Learning is being NP-complete, so as not to waste time looking for a fast algorithm to solve their problems Learning approximation algorithms that can be used to quickly find approximate solutions to NP-complete problems Learning greedy strategy--a very simple problem-solvin

Brief introduction First of all, we have to briefly introduce the algorithm for fast sorting.The fast sort (Quicksort), also known as dividing-exchange sorting (Partition-exchange sort), is a sort algorithm that was first proposed by Donny Holl. In average, sort n items to be 0 (n log n) times compared. In the worst-case scenario, 0 (N2) comparisons are required, but this is not a common situation. In fact,

There is no doubt that the integration of artificial intelligence and search engine is the trend, the current search engine of various algorithms, or based on software programming design, so the algorithm is only a defect of the previous algorithm to repair, so the current search engine potential problems still have no way to completely solve, such as how the Web site through the memory of the way to sort,

Reprint Address: http://www.cnblogs.com/biyeymyhjob/archive/2012/07/30/2615542.htmlOneself learning, feel this speak very good, on reprint.Prim algorithm1. OverviewPrimm algorithm (prim algorithm), an algorithm in graph theory, can search for the smallest spanning tree in weighted connected graphs. This means that the subset of edges searched by this

MAC (Message authentication code, messaging authentication Code algorithm) is a key hash function algorithm that is compatible with the features of the MD and SHA algorithms, and adds a key on this basis. So Mac algorithms are often called HMAC algorithms.1 , HMAC OverviewThe HMAC algorithm first is based on the Information Digest

Link analysis algorithm: Salsa algorithmThe original intention of the salsa algorithm is to combine the main features of the PageRank and hits algorithms, which can take advantage of the characteristics of the hits algorithm and the query, and also adopt the PageRank "Random walk Model", which is the background of the salsa a