coding dojo algorithm

Transferred from: http://my.oschina.net/liqiong/blog/4921Cohen-sutherland algorithm ( coding Algorithm )Basic idea: For each line segment P1P2, divided into three kinds of situation processing:(1) If the P1P2 is completely inside the window, the line segment is displayed, referred to as "take";(2) If the p1p2 obvious outside the window, then discard the line segm

\ =/o//____/'---' \____//. ' \\| |// `.// / \\||| : ||| // // / _||||| -:- ||||| - // | | \\\ - /// | |// | \_| ''\---/'' | |// \ .-\__ `-` ___/-. /// ___`. .' /--.--\ `. . __// ."" ' Huffman.cppThe main function, here is a bit of a friend problem, temporarily did not think of a good way/*** Book: Algorithmic Analysis and Design * Features: Implementing Haverm

This article was originally published by Spritelw in Http://blog.csdn.net/SpriteLW, can be reproduced at will, but without consent may not be modified, reproduced should retain this statement, otherwise held accountable. Read the book is not as far as the road, today determined to write a SGA (simple genetic alogrithms) program, is to solve the unconstrained optimization problem. Max F (x1,x2) = 21.5 + x1*sin (4 * pi *x1) + x2*sin (* pi * x2) -3.0 4.1 This is the most easy genetic

"H.264/AVC Video Codec Technology detailed" video tutorial has been in the "CSDN College" on-line, the video details of the background, standard protocol and implementation, and through a practical project in the form of the standard of the resolution and implementation of H. A, Welcome to watch! "The paper came to the end of shallow, I know this matter to preach", only by themselves in accordance with the standard document in the form of code to operate, in order to video compression

"H.264/AVC Video codec technology specific explanation" video tutorial has been on the "CSDN College" on-line. The video details the background, standard protocol and implementation, and through a real project in the form of the standard of the resolution and implementation, welcome to watch! "The paper came to light, I know this matter to preach." Only have their own in accordance with the standard document in the form of code, the ability of the video compression

needs a lot of information to characterize, and accurate partition method requires a large number of calculations to determine, Thus the region-based representation is less used in practice. (3), block-based motion notation: The image is divided into different sizes of pixel blocks, as long as the block size is appropriate, the motion of each block can be regarded as uniform, while the motion parameters of each block can be independently estimated. This method, which takes into account the accu

1 exponential Grumb entropy coding algorithm principle1.1 unsigned integer k-order exponential Grumb algorithm encoding process:1) write the number in binary form, remove the lowest k bit, then add 12) calculates the number of bits left, minus one, which is the number of leading 0 digits that need to be increased3) Replace the lowest k bits removed in the first s

The overall overview of the implementation process of the genetic algorithm is as follows: 1, choose the coding strategy, convert the parameters into strings; 2, according to the population size n, randomly produces n string composition of the group; 3, according to the fitness function f=f (x) to calculate the fitness of each string; 4, according to the replication probability of the string f=f (x) Select

Objective The LZ77 algorithm is a lossless compression algorithm, published by the Israeli Abraham Lempel in 1977. LZ77 is a typical dictionary-based compression algorithm, and many compression techniques are now based on LZ77. In view of its position in the field of data compression, this article will be combined with the image and source details of its principl

-left reference pixel does not exist, the lower-left area of all the reference pixels can be used to fill the lower-left area of the pixel at the bottom, if the upper right area of the reference pixel does not exist, You can use the rightmost pixel in the upper area to fill it (as in the right-hand example). It should be explained that if all the reference pixels are not available, the reference pixels are populated with fixed values, and for 8-bit pixels, the predicted value is 128, and for 10-

100 times the latter, but it does use the same number of digits in the binary. Can do better, the method is variable length coding, the guiding principle is high frequency with a shorter number of digits encoded, low frequency with a longer digit code. Huffman coding algorithm is to deal with such problems. Huffman coded Java implementation The main data struc

thing to note here is that our Huffman does not conflict with the encoding of individual characters, that is, there is no prefix for another encoding, otherwise it would be a big problem. Because the encoding after encode is no delimiter.So, for our original string beep Boop beer!The binary to be able is: 0110 0010 0110 0101 0110 0101 0111 0000 0010 0000 0110 0010 0110 1111 0110 1111 0111 0000 0010 0000 0110 0010 0110 0101 0110 0101 0111 0010 0010 0001Our Huffman codes are: 0011 1110 1011 0001

class Aesencryptutil {private static final String TAG = "Aesencryptutil"; private static final String UTF8 = "UTF-8"; Private static final String AES = "AES"; private static final String aes_cbc_pkcs5_padding = "aes/cbc/pkcs5padding"; private static final String aes_cbc_no_padding = "aes/cbc/nopadding"; /** * JDK only supports AES-128 encryption, that is, the key length must be 128bit, the parameter is the key Key,key length is less than 16 characters with "0" supplement, the k

Reprint: http://www.cnblogs.com/xqxacm/p/4886299.htmlFirst, what is encoded decodingCoding: The use of specific algorithms, the original content processing, generate the operation of the content, the formation of another form of data, can be based on the algorithm, and then restore back, this operation is called coding.Decoding: Using the inverse operation of the algorithm used by the code, processing the e

this priority Queue into a binary tree. We always take two elements from the head of the queue to construct a binary tree (the first element is the left node, the second is the right node), and add the priority of the two elements and put it back in the order (note again that the priority here is the number of occurrences of the character), and then, We get the following data graph:Again, we take the first two out to form a node with priority 2+2=4, and then put it back in the order queue:Conti

contains only a binary tree, at this time to get this binary tree is Huffman tree.Huffman Tree has no degree of 1 nodes, and has n characters of Huffman tree node total of 2n-1, so you can use sequential storage structure to implement Huffman algorithm. Stores the node information in a one-dimensional array of 2n-1. When the Huffman tree is constructed, the encoding process of each character is to walk a path from the leaf node to the root node. The

Brief introductionIn the previous article: gray-based template matching algorithm (a): MAD, SAD, SSD, MSD, NCC, SSDA algorithm, introduced several typical template matching algorithms, but this kind of algorithm has a high time complexity, image size sensitivity and other issues, The complexity of optimization algorithms, even for SSDA, is high.This paper introdu