Computer Vision: Algorithms and Applications (Texts in Computer Science) . Computer Vision. List of algorithms - Wikipedia. From Wikipedia, the free encyclopedia. The following is a list of algorithms along with one- line descriptions for each. Automated planning. Combinatorial algorithms. General combinatorial algorithms. A computer algebra system (CAS) is any mathematical software with the ability to manipulate mathematical expressions in a way similar to the traditional manual. The following is a list of algorithms along with one-line descriptions for each. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and. Absil Robert Mahony Rodolphe Sepulchre PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD. This site contains design and analysis of various computer algorithms such as divide-and-conquer, dynamic, greedy, graph, computational geometry etc. It also contains. Contents ix 21 Algorithms for Algorithmia offers a turnkey platform that gives algorithm developers the ability to publish their algorithms as a live, hosted web service, make them easily. Graph algorithms. Graph drawing. Network theory. Routing for graphs. Graph search. Subgraphs. Sequence algorithms. Approximate sequence matching. Selection algorithms. Sequence search. Sequence merging. Simple merge algorithmk- way merge algorithm. Union (merge, with elements on the output not repeated)Sequence permutations. Sequence alignment. Sequence sorting. Exchange Sorts. Bubble sort: for each pair of indices, swap the items if out of order. Cocktail shaker sort or bidirectional bubble sort, a bubble sort traversing the list alternately from front to back and back to front. Comb sort. Gnome sort. Odd- even sort. Quicksort: divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists. Often the method of choice. Humorous or ineffective. Flashsort. Introsort: begin with quicksort and switch to heapsort when the recursion depth exceeds a certain level. Timsort: adaptative algorithm derived from merge sort and insertion sort. Used in Python 2. Java SE 7. Insertion sorts. Merge sort: sort the first and second half of the list separately, then merge the sorted lists. Strand sort. Non- comparison sorts. Selection sorts. Heapsort: convert the list into a heap, keep removing the largest element from the heap and adding it to the end of the list. Selection sort: pick the smallest of the remaining elements, add it to the end of the sorted list. Smoothsort. Other. Subsequences. Substrings. Computational mathematics. Abstract algebra. Computer algebra. Geometry. Number theoretic algorithms. Numerical algorithms. Differential equation solving. Elementary and special functions. Geometric. Interpolation and extrapolation. Linear algebra. Monte Carlo. Numerical integration. Root finding. Optimization algorithms. Computational science. Astronomy. Bioinformatics. Geoscience. Vincenty's formulae: a fast algorithm to calculate the distance between two latitude/longitude points on an ellipsoid. Linguistics. Medicine. Physics. Statistics. Computer science. Computer architecture. Tomasulo algorithm: allows sequential instructions that would normally be stalled due to certain dependencies to execute non- sequentially. Computer graphics. Cryptography. Asymmetric (public key) encryption. Cryptographic hash functions. HMAC: keyed- hash message authentication. MD5 – Note that there is now a method of generating collisions for MD5. RIPEMD- 1. 60. RTR0. SHA- 1. SHA- 2 (SHA- 2. SHA- 2. 56, SHA- 3. SHA- 5. 12)SHA- 3 (SHA3- 2. SHA3- 2. 56, SHA3- 3. SHA3- 5. 12, SHAKE1. SHAKE2. 56)Tiger (TTH), usually used in Tiger tree hashes. WHIRLPOOLCryptographically secure pseudo- random number generators. Key exchange. Key derivation function, often used for hashing passwords. Secret sharing, Secret Splitting, Key Splitting, M of N algorithms. Symmetric (secret key) encryption. Digital logic. Machine learning and statistical classification. Programming language theory. Parsing. Quantum algorithms. Theory of computation and automata. Information theory and signal processing. Coding theory. Error detection and correction. Lossless compression algorithms. Lossy compression algorithms. Digital signal processing. Image processing. Software engineering. Database algorithms. Distributed systems algorithms. Memory allocation and deallocation algorithms. Networking. Operating systems algorithms. Process synchronization. Scheduling. Disk scheduling. See also. References.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
August 2017
Categories |