Search results
Jump to navigation
Jump to search
Page title matches
- In mathematics or computer science, an '''algorithm''' is a sequence of steps for one particular method of solving a problem, s ...s, preferably data maintained in a consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on w2 KB (286 words) - 07:49, 10 February 2021
- 80 bytes (12 words) - 19:52, 20 May 2008
- ...or finding the [[greatest common divisor]] (gcd) of two [[integer]]s. The algorithm does not require [[prime number|prime factorizations]] and runs efficiently == The algorithm ==7 KB (962 words) - 12:05, 3 May 2016
- | title = The advent of the algorithm : the idea that rules the world1 KB (212 words) - 17:42, 20 February 2012
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 14:37, 8 August 2007
- ...orithm''' is the best known and most widely used [[public key]] encryption algorithm. Like any public key system, it can be used to create [[digital signature]] The algorithm was patented <ref>{{US patent|4405829}}</ref> in 1983 by [[MIT]], but relea7 KB (1,171 words) - 05:48, 8 April 2024
- 12 bytes (1 word) - 11:05, 24 September 2007
- <!-- Text is transcluded from the Algorithm (finance)/Definition subpage-->88 bytes (11 words) - 05:21, 12 July 2010
- The '''Naranjo algorithm''' is a questionnaire designed by Naranjo ''et al''<ref name="pmid7249508"> * [http://mqa.dhs.state.tx.us/QMWeb/MedSim/Naranjo.htm Naranjo algorithm]3 KB (432 words) - 17:35, 10 February 2024
- ...://mathworld.wolfram.com/Algorithm.html Mathworld]<span> - Definition of ''algorithm'' on Mathworld.1 KB (150 words) - 07:48, 10 February 2021
- Algorithm for finding the greatest common divisor of two integers101 bytes (13 words) - 15:31, 20 May 2008
- The '''Tiny Encryption Algorithm''', or '''TEA''' | title = TEA, a Tiny Encryption Algorithm3 KB (367 words) - 05:49, 8 April 2024
- 255 bytes (37 words) - 17:34, 10 February 2024
- {{r|Euclidean algorithm}}888 bytes (123 words) - 17:03, 13 July 2008
- 182 bytes (25 words) - 05:20, 12 July 2010
- A widely used [[public key]] encryption algorithm whose strength depends on the difficulty of integer factorisation.152 bytes (19 words) - 18:53, 29 July 2010
- 12 bytes (1 word) - 11:47, 26 September 2007
- 39 bytes (4 words) - 06:05, 28 November 2008
- 39 bytes (4 words) - 07:25, 29 November 2008
- 12 bytes (1 word) - 12:13, 18 January 2008
- The '''International Data Encryption Algorithm''' or '''IDEA'''4 KB (558 words) - 05:49, 8 April 2024
- Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human. {{r|Algorithm}}618 bytes (80 words) - 16:24, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Naranjo algorithm]]. Needs checking by a human.500 bytes (64 words) - 18:51, 11 January 2010
- 190 bytes (27 words) - 00:46, 1 October 2009
- 259 bytes (33 words) - 18:53, 29 July 2010
- 176 bytes (23 words) - 14:27, 22 May 2011
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 18:44, 6 May 2007
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 15:00, 8 August 2007
Page text matches
- ...cipher, named because it applies the Data Encryption Standard (DES) cipher algorithm three times to each data block.223 bytes (32 words) - 00:50, 1 October 2009
- ...res/lec20/lec20.htm Cornell University lecture on Dijkstra's Shortest Path Algorithm] ...c.jp/ikeda/suuri/dijkstra/Dijkstra.shtml Shortest Path Problem: Dijkstra's Algorithm]406 bytes (51 words) - 19:42, 12 October 2013
- ...text]], a form unintelligible to any recipient that does not know both the algorithm and a randomizing factor called a [[cryptographic key]]352 bytes (48 words) - 22:02, 31 July 2008
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:53, 29 July 2010
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 14:37, 8 August 2007
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 15:00, 8 August 2007
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:56, 29 July 2010
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:55, 29 July 2010
- #REDIRECT [[RSA algorithm]]27 bytes (3 words) - 18:59, 29 July 2010
- #REDIRECT[[Euclidean algorithm]]32 bytes (3 words) - 18:44, 6 May 2007
- #REDIRECT [[RSA algorithm/Definition]]38 bytes (4 words) - 18:53, 29 July 2010
- #REDIRECT [[RSA algorithm/Related Articles]]44 bytes (5 words) - 18:53, 29 July 2010
- {{r|International Data Encryption Algorithm}} {{r|RSA algorithm}}251 bytes (31 words) - 18:32, 13 March 2024
- A widely used sorting algorithm invented by Hoare.86 bytes (11 words) - 02:15, 14 November 2010
- <!-- Text is transcluded from the Algorithm (finance)/Definition subpage-->88 bytes (11 words) - 05:21, 12 July 2010
- The study of [[nervous system]]s with [[algorithm]]ic approaches.101 bytes (13 words) - 08:30, 14 September 2009
- Data structured in a way that they lend themselves to [[algorithm]]ic analysis.115 bytes (16 words) - 16:07, 31 March 2010
- Algorithm for finding the greatest common divisor of two integers101 bytes (13 words) - 15:31, 20 May 2008
- ...case of multiple encryption, ciphertext is still the result of applying an algorithm and key to ciphertext produced by a different cryptosystem.411 bytes (57 words) - 18:12, 28 July 2008
- Methods for attacking the Rivest, Shamir and Adleman public-key cryptography algorithm.124 bytes (14 words) - 06:55, 1 October 2009
- In mathematics or computer science, an '''algorithm''' is a sequence of steps for one particular method of solving a problem, s ...s, preferably data maintained in a consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on w2 KB (286 words) - 07:49, 10 February 2021
- A widely used [[public key]] encryption algorithm whose strength depends on the difficulty of integer factorisation.152 bytes (19 words) - 18:53, 29 July 2010
- An algorithm that sequences elements of a list in a certain order.103 bytes (15 words) - 19:33, 4 September 2009
- Value used by a computer together with a complex algorithm to encrypt and decrypt messages.128 bytes (18 words) - 06:28, 4 September 2009
- The result of applying a [[encryption]] algorithm and an [[encryption key]] to [[plaintext]]]129 bytes (16 words) - 18:11, 28 July 2008
- ...est known for his PhD thesis design of the [[International Data Encryption Algorithm]] at [[ETH Zurich]] under advisor [[James Massey]].191 bytes (24 words) - 14:23, 22 May 2011
- Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human. {{r|Algorithm}}618 bytes (80 words) - 16:24, 11 January 2010
- ...ptography|Cryptographer]] who teaches at [[MIT]], co-inventor of the [[RSA algorithm]], the most widely used public key encryption technique.182 bytes (22 words) - 20:04, 29 July 2010
- In [[computer graphics]], an algorithm for constructing a 3D surface mesh from scalar 3D data, e.g. as obtained fr170 bytes (24 words) - 05:15, 5 February 2010
- An algorithm that produces a fixed-size digest from an input of essentially arbitrary si127 bytes (17 words) - 01:10, 27 November 2008
- *[[Evolutionary algorithm]] *[[Genetic algorithm]]1 KB (106 words) - 12:08, 15 November 2008
- {{r|Diamond-square algorithm}} {{r|Box-counting algorithm}}1 KB (184 words) - 06:32, 3 February 2010
- ...], [[image processing|processing]] or interpreting of images by means of [[algorithm]]s executed on a [[computer]].176 bytes (22 words) - 16:46, 7 September 2010
- '''Quicksort''' is a sorting [[algorithm]] developed by C. A. R. Hoare. ...ter moving the pivot value between the two separated groups, the quicksort algorithm is recursivly performed on the smaller groups.1 KB (181 words) - 09:18, 14 September 2013
- * [[International Data Encryption Algorithm]], a topic in [[cryptography]]212 bytes (26 words) - 12:51, 31 May 2009
- ...te]]; basic of [[Open Shortest Path First]]; sometimes called the Dijkstra algorithm217 bytes (28 words) - 10:40, 23 October 2009
- "Euclid's algorithm": 98% "Euclid's Algorithm": 2%739 bytes (70 words) - 17:12, 10 May 2007
- ...[[Clipper chip]]. It was to be used only in tamperproof hardware, and the algorithm was originally classified. This added to the controversy, with many people ...Feistel cipher]] with 64-bit blocks, an 80-bit key and 32 rounds. Once the algorithm was public, the first paper describing an attack on a reduced-round version1 KB (187 words) - 05:48, 8 April 2024
- ...student [[Xuejia Lai]], co-designer of the [[International Data Encryption Algorithm]].197 bytes (24 words) - 14:30, 22 May 2011
- Bioinformatics algorithm for comparing primary biological sequence information, such as the amino-ac208 bytes (25 words) - 02:09, 5 September 2009
- ..., [[El Gamal]] (encrypt-only, not for signatures), and [[Digital Signature Algorithm]]. Supported [[block cipher]]s are [[IDEA]], [[Triple DES]], [[CAST-128]],910 bytes (125 words) - 05:49, 8 April 2024
- The [[algorithm]]ic representation of one surface (e.g. that of the [[earth]]) on another (150 bytes (24 words) - 08:12, 1 March 2010
- ...nted by Joan Daemen and Vincent Rijmen, and a forerunner to the [[Rijndael algorithm]], which has been adopted as the [[Advanced Encryption Standard]].211 bytes (29 words) - 17:13, 22 January 2010
- ...in the field of [[geometry]]. Most problems involve efficient and robust [[algorithm]]s which can be executed on a computer.210 bytes (28 words) - 19:05, 12 February 2008
- Sequential procedure or algorithm for constructing a set of mutually orthogonal vectors from a given set of l173 bytes (23 words) - 12:20, 22 January 2009
- ...d and some preset algorithm can be performed on the base sized input. The algorithm then performs some function on the separate parts which have already been p789 bytes (131 words) - 10:30, 13 February 2009
- ...r algebra]], Gram-Schmidt orthogonalization is a sequential procedure or [[algorithm]] for constructing a set of mutually orthogonal [[vector space|vectors]] fr ==The Gram-Schmidt orthogonalization algorithm==2 KB (301 words) - 06:39, 21 October 2007
- ...eristics and generation of data which, in combination with a cryptographic algorithm, introduces or removes the concealment applied to [[plaintext]] or taken to346 bytes (45 words) - 11:07, 30 October 2008
- <!--A function which subsumes the functionality of a large number of algorithm-based functions in other systems.!-->255 bytes (39 words) - 07:52, 5 July 2011
- ...eterministic, is based upon how the tags respond during the anti-collision algorithm. ...dentification number. The simplest deterministic scheme is the binary tree algorithm.3 KB (407 words) - 21:13, 21 February 2009
- ...student [[Xuejia Lai]], co-designer of the [[International Data Encryption Algorithm]], IDEA.296 bytes (41 words) - 05:48, 8 April 2024
- ...ute]] in Israel. He is the "S" in "RSA", one of the inventors of the [[RSA algorithm]].265 bytes (43 words) - 08:38, 22 October 2010
- == An algorithm involving prime factorizations == == An algorithm not involving prime numbers ==4 KB (570 words) - 18:05, 1 July 2009
- ...king whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time.245 bytes (34 words) - 16:08, 27 July 2023
- ...urce authentication]]. The term '''HMAC''' is often used for both the HMAC algorithm and for the HMAC token that is appended to a message. HMACs use a [[cryptographic hash]] algorithm and a [[cryptographic key|symmetric key]] that is shared by the sender and2 KB (313 words) - 05:49, 8 April 2024
- {{r|Euclidean algorithm}}209 bytes (27 words) - 05:38, 3 July 2009
- {{r|Algorithm}}251 bytes (28 words) - 12:25, 20 February 2024
- ...the '''complexity of an algorithm''' is a way to classify how efficient an algorithm is, compared to alternative ones. The focus is on how [[execution time]] i ...arameters extend towards their extremes), the actual execution time of the algorithm is bounded by <math>K\times f(x_1,x_2,\ldots,x_n)</math> for some positive7 KB (1,080 words) - 07:53, 10 August 2008
- In mathematics, the ''sieve of Eratosthenes'' is an [[Algorithm|algorithm]] for finding all prime numbers up to a certain value, say ''N''. After fir1 KB (172 words) - 20:13, 7 December 2020
- ...sor named "Threefish", used in the [[Skein (hash algorithm) | Skein]] hash algorithm, a candidate in the [[Advanced Hash Standard]] contest. That is another new1 KB (176 words) - 05:48, 8 April 2024
- * [[Algorithm|Algorithms]]509 bytes (52 words) - 20:02, 19 April 2011
- {{r|Euclidean algorithm}}147 bytes (16 words) - 07:52, 29 June 2009
- {{r|Algorithm}}274 bytes (38 words) - 11:28, 7 August 2008
- {{r|Risch algorithm}}368 bytes (47 words) - 07:54, 13 July 2008
- '''MAGENTA''' or '''Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications'' | title = The MAGENTA Block Cipher Algorithm2 KB (235 words) - 05:49, 8 April 2024
- ...ened up may prove to have drastic consequences for the future: e.g. Shor's algorithm relevance to cryptography. ===Deutsch algorithm===8 KB (1,344 words) - 23:59, 8 February 2010
- ...+a_nx_n=b</math>, which may be solved by means of the extended [[Euclidean algorithm]].542 bytes (82 words) - 19:39, 7 April 2009
- ...er is accurate to only two significant figures! On the other hand, if the algorithm was somehow set up to subtract the 2,000,000 before adding 0.33333333, the1 KB (225 words) - 22:09, 3 September 2010
- {{r|Algorithm}}542 bytes (63 words) - 14:59, 1 November 2014
- * In [[computer science]], the repeated application of some algorithm, code, program, using the result of the previous application as input.449 bytes (65 words) - 00:41, 10 July 2013
- ...mber generator, in which the numbers are not truly random, but based on an algorithm which creates a diverse range of numbers.450 bytes (71 words) - 00:44, 3 August 2009
- ...computer program capable of translating a unambiguous description of an [[algorithm]] into a form which can be executed by a machine. To design a compiler req ...hm will always perform the task properly, and analyze how efficiently said algorithm performs its task against criteria such as time or memory complexity before4 KB (608 words) - 13:08, 17 April 2013
- {{r|Euclidean algorithm}}350 bytes (42 words) - 12:01, 12 June 2009
- ...yptographer]] best known for designing the [[International Data Encryption Algorithm]]. That work was his PhD Thesis634 bytes (89 words) - 05:48, 8 April 2024
- {{r|Algorithm}}353 bytes (42 words) - 12:12, 12 April 2011
- * [[Sergei Brin]] ( - ) - Co-developer of page-rank search algorithm and co-founder of [[Google]]. * [[Larry Page]] ( - ) - Co-developer of page-rank search algorithm and co-founder of [[Google]].2 KB (232 words) - 18:13, 8 November 2008
- * [[Algorithm|Algorithms]] - Ways of solving problems with computer programs.495 bytes (65 words) - 03:16, 9 June 2008
- {{r|International Data Encryption Algorithm}}315 bytes (47 words) - 14:26, 22 May 2011
- {{r|RSA algorithm}}398 bytes (43 words) - 20:00, 29 July 2010
- {{r|Algorithm}}433 bytes (55 words) - 20:29, 11 January 2010
- {{r|Genetic algorithm}}506 bytes (63 words) - 01:21, 13 March 2009
- {{r|Algorithm}}460 bytes (59 words) - 16:01, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Naranjo algorithm]]. Needs checking by a human.500 bytes (64 words) - 18:51, 11 January 2010
- Finally, a <i>[[calendar]]</i> is an algorithm for systematically assigning names to dates552 bytes (93 words) - 18:25, 25 September 2007
- {{r|Algorithm}}512 bytes (63 words) - 16:57, 11 January 2010
- * IDEA, the [[International Data Encryption Algorithm]], a European standard, not a Feistel cipher, with only 8 rounds and no S-b * The [[Tiny Encryption Algorithm]], or '''TEA''', designed to be very small and fast but still secure, a 32-4 KB (551 words) - 12:36, 13 April 2016
- {{r|Evolutionary algorithm}}655 bytes (73 words) - 13:21, 14 April 2021
- ...Ananth N, Implementation of Decision Tree Classifier Using Classification Algorithm for Some Inborn Errors of Metabolism, Proc. Global Convention and Expositio ...n Algorithm http://www.cs.mdx.ac.uk/staffpages/serengul/The.Classification.algorithm.htm (Accessed July 2006).2 KB (263 words) - 15:37, 26 April 2008
- {{r|Algorithm}}566 bytes (76 words) - 15:51, 11 January 2010
- '''Basic Local Alignment Search Tool''' (BLAST) is an [[algorithm]] in [[bioinformatics]] with the purpose of searching a preprocessed [[data759 bytes (108 words) - 16:00, 4 March 2009
- ...or finding the [[greatest common divisor]] (gcd) of two [[integer]]s. The algorithm does not require [[prime number|prime factorizations]] and runs efficiently == The algorithm ==7 KB (962 words) - 12:05, 3 May 2016
- ...tage is non-free distribution. It can be useful to understand, how does an algorithm works; then in order to make some software and distribute it, the algorithm should be re-written.2 KB (338 words) - 17:26, 7 February 2009
- {{r|RSA algorithm}}568 bytes (75 words) - 20:10, 29 July 2010
- ...r scientist]], known for his work in the design and analysis of computer [[algorithm]]s. He is the James S. McDonnell Distinguished University Professor of Comp ...nd 1972, respectively. His Ph.D. dissertation was ''An Efficient Planarity Algorithm'', and his advisor was eminent computer scientist [[Robert Floyd]].<ref>{{c5 KB (696 words) - 22:43, 11 February 2010
- {{r|Evolutionary algorithm}}732 bytes (98 words) - 16:57, 10 November 2010
- ...compiler must solve such a problem. Thus, a compiler uses a [[heuristic]] algorithm to produce a sub-optimal solution to the vertex coloring problem, attemptin ==The Algorithm==9 KB (1,338 words) - 10:00, 16 July 2013
- ...://mathworld.wolfram.com/Algorithm.html Mathworld]<span> - Definition of ''algorithm'' on Mathworld.1 KB (150 words) - 07:48, 10 February 2021
- {{r|Algorithm}}586 bytes (76 words) - 19:57, 11 January 2010
- ...r theory]], the Chinese remainder theorem forms the theoretical basis of [[algorithm]]s for [[storing integers]] and in [[cryptography]]. The Chinese remainder ...es not help us to find it. We can do this by appealing to the [[Euclidean algorithm]]. If <math>n_1</math> and <math>n_2</math> are coprime, then there exist3 KB (535 words) - 15:02, 22 November 2008
- {{r|RSA algorithm}}707 bytes (89 words) - 20:09, 29 July 2010
- {{r|Algorithm}}774 bytes (99 words) - 15:36, 11 January 2010
- == A simple theoretical question and a primitive algorithm == ...it is desired to find the smallest common multiple of 63 and 77. Euclid's algorithm tells us that the greatest common divisor of 63 and 77 is 7. Then the leas6 KB (743 words) - 18:42, 2 July 2009
- ...home page] for the cipher. Internet RFC 5794 gives a specification of the algorithm for Internet use and RFC 6209 discusses its applications.664 bytes (101 words) - 10:08, 2 December 2013
- Suppose we had an [[algorithm]] which was to select the largest number in an [[array]]. One straight-for Once the algorithm attempts its first read, the processor's memory controller will fetch not j4 KB (634 words) - 04:17, 9 March 2010
- ...utions or not. After that, as in gene transfer in sexual reproduction, the algorithm creates a new population of candidate solutions. ...Bruce G; Manuck, Steven; Smith, Gwenn and Sale, Mark E(2006), ''A Genetic Algorithm-Based, Hybrid Machine Learning Approach to Model Selection'' Journal of Pha4 KB (585 words) - 13:56, 26 September 2007
- For example, a machine learning algorithm for [[Machine translation]] may be presented with several thousand examples ...ample in the introduction is an example of supervised training because the algorithm sees the same sentence in both languages.4 KB (599 words) - 23:58, 30 June 2011
- {{r|Algorithm}}934 bytes (121 words) - 15:37, 11 January 2010
- {{r|Algorithm}}941 bytes (125 words) - 11:34, 11 January 2010
- {{r|Euclidean algorithm}}927 bytes (119 words) - 16:24, 11 January 2010
- {{r|Euclidean algorithm}}888 bytes (123 words) - 17:03, 13 July 2008
- The '''Tiny Encryption Algorithm''', or '''TEA''' | title = TEA, a Tiny Encryption Algorithm3 KB (367 words) - 05:49, 8 April 2024
- {{r|Evolutionary algorithm}}959 bytes (149 words) - 10:01, 6 August 2011
- The '''Naranjo algorithm''' is a questionnaire designed by Naranjo ''et al''<ref name="pmid7249508"> * [http://mqa.dhs.state.tx.us/QMWeb/MedSim/Naranjo.htm Naranjo algorithm]3 KB (432 words) - 17:35, 10 February 2024
- ...older [[KG-84]] family. Like the KG-84, it uses the classified encryption algorithm nicknamed WINDSTER. Various KIV-7 family devices are essentially miniaturiz1 KB (139 words) - 15:21, 3 December 2009
- ...the hyphal tips that choose the growth direction following some supposed [[algorithm]]. The model was Audrius Meškauskas and David Moore in 2004 and proven usi ...generation systems, field sensing mechanisms and growth direction altering algorithm. Under properly chosen model parameters it is possible to observe the trans3 KB (490 words) - 09:33, 21 September 2013
- {{r|Pitch detection algorithm}}1 KB (182 words) - 18:27, 13 July 2012
- Namely for this case, the special algorithm [[fsexp.cin]] is loaded; it is described in [[Vladikavkaz Mathematical Joru The evaluation uses almost the same algorithm of the Cauchi integral <ref name=analuxp>6 KB (929 words) - 05:34, 2 September 2014
- | title = The advent of the algorithm : the idea that rules the world1 KB (212 words) - 17:42, 20 February 2012
- ...92-bit byte array, which is the actual key. To implement the Triple-DES algorithm, for example, encryption occurs three times: first, the plain text is encry An example of a public-key encryption algorithm is RSA (which stands for Rivest, Shamir, and Adleman, its developers' last5 KB (879 words) - 09:41, 28 September 2023
- ...n [[edge detection]], on [[a priori information]], or [[deformable-surface algorithm]]s. Various combinations thereof are also frequently employed.1 KB (175 words) - 06:37, 18 February 2010
- ...- Decompression" or "Coder - Decoder". Most of the time, it refers to an [[algorithm]], but sometimes the term is used to describe a device that performs these1 KB (191 words) - 01:11, 6 February 2010
- *[[exponential algorithm]]1 KB (175 words) - 08:22, 12 February 2009
- {{r|RSA algorithm}}1 KB (173 words) - 14:49, 4 April 2024
- ...ef> In 1978, Ronald Rivest, Adi Shamir, and Len Adleman invented the [[RSA algorithm]], another public-key system<ref name=RSA>{{citation ...t symmetric key is sent with the message, but encrypted using a public-key algorithm. Similarly, hybrid signature schemes are often used, in which a cryptograp8 KB (1,233 words) - 05:48, 8 April 2024
- ...orithm''' is the best known and most widely used [[public key]] encryption algorithm. Like any public key system, it can be used to create [[digital signature]] The algorithm was patented <ref>{{US patent|4405829}}</ref> in 1983 by [[MIT]], but relea7 KB (1,171 words) - 05:48, 8 April 2024
- ...ptographer who teaches at MIT. He is probably best known as the "R" in RSA algorithm|RSA, co-inventor of of the most widely used public key encryption technique1 KB (195 words) - 07:35, 18 March 2024
- ...g protocols for small to mid-sized networks. A firm understanding of this algorithm will help in studying these protocols. ...and indices. You can follow every statement, and still not understand the algorithm. If you are not familiar with Python, see [[shortest path routing/Catalogs/11 KB (1,749 words) - 10:42, 3 July 2022
- *[[MINTO]] - integer programming solver using branch and bound algorithm. Freeware for personal use.2 KB (239 words) - 06:44, 20 March 2008
- ...emissions in [[computer-aided tomography]] (CAT scans), to the compression algorithm for images such as .jpg.1 KB (184 words) - 13:47, 27 July 2020
- {{r|Naranjo algorithm}}2 KB (219 words) - 21:43, 11 January 2010
- <td>[[International Data Encryption Algorithm|IDEA]]</td><td></td><td>64</td><td>128</td><td>8</td><td>none</td><td>modul <td>[[Tiny Encryption Algorithm|TEA]]</td><td>Feistel</td><td>64</td><td>128</td><td>32</td><td>none</td><t7 KB (1,292 words) - 12:20, 27 July 2010
- ...(cryptography)#SHA-1|SHA-1]], which dates from 1994; the SHA-1 [[Algorithm|algorithm]] takes a string as input and always outputs a 160-bit number (20 bytes of4 KB (586 words) - 15:45, 8 April 2024
- ...on to the [[integer factorisation]] problem would break RSA; see the [[RSA algorithm#RSA_and_factoring | RSA article]] for discussion. The difficulty with that1 KB (215 words) - 05:48, 8 April 2024
- ...wood P (2007) '[http://dx.doi.org/10.1126/science.1134513 The early years: algorithm-guided individualized reading instruction].' ''Science'' 315: 464-465.1 KB (191 words) - 19:19, 27 December 2008
- '''DEAL''', the '''Data Encryption Algorithm with Larger blocks'''1 KB (215 words) - 14:23, 30 September 2009
- ...T was a Soviet national standards body. There was also a related GOST hash algorithm,1 KB (228 words) - 05:49, 8 April 2024
- ...a fraction, convert the integer into a fraction and apply the appropriate algorithm. Formally, apply this algorithm to multiply the fractions <math> \frac{a}{b} </math> and <math> \frac{c}{d}21 KB (3,089 words) - 10:08, 28 February 2024
- {{r|Euclidean algorithm}}2 KB (247 words) - 17:28, 11 January 2010
- | title = On the Security of the CAST Encryption Algorithm1 KB (209 words) - 21:41, 26 November 2010
- | title= The FROG Encryption Algorithm1 KB (225 words) - 14:53, 30 September 2009
- ...ctionary is useful against all machines using the same password encryption algorithm, which often means all machines running the same operating system. Also, a ...le machine about as fast as the target systems. In many cases the password algorithm is faster than that. It may also be faster on the attacker's machine than o12 KB (1,937 words) - 15:51, 8 April 2024
- // The algorithm below expresses [[Filog]] through the [[Tania function]]; the routines for2 KB (282 words) - 08:55, 2 October 2013
- {{r|DARTEL (algorithm)}}2 KB (281 words) - 10:43, 20 February 2024
- {{r|Euclidean algorithm}}2 KB (262 words) - 19:07, 11 January 2010
- Fortunately, the [[Euclidean algorithm]] provides an efficient means to calculate the greatest common divisor. i.e., in rings for which there is an analogue to the Euclidean algorithm,5 KB (797 words) - 04:57, 21 April 2010
- ...uickly shown to be weak, and replaced with [[International Data Encryption Algorithm|IDEA]] in version 2.0. This was the version that became widespread and esta ...ter versions of PGP also support the [[NSA]]-developed [[Digital Signature Algorithm]]; at one point, there was an advantage to this in that it was unpatented.7 KB (1,143 words) - 05:49, 8 April 2024
- '''Proof:''' Because ''p'' and ''q'' are relatively prime, the [[Euclidean Algorithm]] tells us that2 KB (322 words) - 12:51, 18 December 2007
- * Manipulate the coherence in a manner specified by the [[algorithm]] of interest and2 KB (307 words) - 17:00, 7 March 2024
- | title = Security of the WEP algorithm2 KB (314 words) - 05:49, 8 April 2024
- The algorithm is described at2 KB (346 words) - 03:07, 2 September 2014
- ...that fits the access pattern of the data can improve the performance of [[algorithm|algorithms]] significantly. Using such an abstract view on the data structures to use in an algorithm helps to focus on the task at hand. But sometimes this is not possible beca7 KB (1,246 words) - 17:24, 31 July 2008
- ...died and analyzed by experts to determine if it is likely to be secure. An algorithm that you have invented yourself and kept secret has not had the opportunity7 KB (1,186 words) - 14:20, 8 March 2024
- A common approach to user-based nearest neighbor algorithm is:<br /> Generally, a CF algorithm has a worst case complexity of O(MN) where M is the number of users and N i15 KB (2,211 words) - 06:47, 19 October 2013
- ...S record with a HTTP query, allowing the domain owner to use any arbitrary algorithm to authorize use of a domain name for any purpose, and to register where it2 KB (354 words) - 10:19, 3 January 2010
- | title= An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance Suppose you want to factor N = pq with p, q odd primes, the [[RSA algorithm|RSA]] problem. Use discrete log to solve for x in 2<sup>x</sup>5 KB (772 words) - 17:15, 6 August 2013
- ...ng cache''' which contains only the routes which are chosen by the routing algorithm as preferred routes for packet forwarding, often in a compressed or pre-com ...''next hop''. Assuming that the routing tables are consistent, the simple algorithm of relaying packets to their destination's next hop thus suffices to delive6 KB (958 words) - 16:23, 30 March 2024
- ...</ref> or may not improve [[warfarin]] dosing compared to the Kovacs 10 mg algorithm<ref name="pmid17989110">{{cite journal |author=Anderson JL, Horne BD, Steve5 KB (713 words) - 17:34, 10 February 2024
- ...also called the '''Newton-Raphson method''', is a numerical [[root-finding algorithm]]: a method for finding where a function obtains the value zero, or in othe ==Description of the algorithm==17 KB (2,889 words) - 12:40, 11 June 2009
- {{r|Algorithm}}3 KB (353 words) - 03:48, 24 September 2013
- ...an''' or '''CAT scan''') is a form of [[tomography]] that uses a computer algorithm to reconstruct the image. ...This is defined as "tomography using [[x-ray]] transmission and a computer algorithm to reconstruct the image."<ref name="MeSH-CTX">{{cite web |url=http://www.n6 KB (785 words) - 02:22, 15 May 2010
- ...n, other implementations can be built-up with minimal modifications of the algorithm, shifting and scaling the argument of the function and applying the corresp ...laced also at the right hand side as well, and interpreted as $x_{N}$. The algorithm makes no difference between these points.11 KB (1,589 words) - 08:58, 9 September 2020
- ...]], [[creativity]] etc. are all considered to be functions of the common [[algorithm]] on which the neocortex operates. it consists of a large number of tightly2 KB (358 words) - 17:09, 21 March 2024
- ...died and analyzed by experts to determine if it is likely to be secure. An algorithm that you have invented yourself and kept secret has not had the opportunity8 KB (1,338 words) - 05:49, 8 April 2024
- Description of the algorithm of evaluation is available3 KB (406 words) - 04:28, 2 September 2014
- ...on]] is more convenient than that through the [[LambertW]]; the efficient algorithm for evaluation of the [[Tania function]] is available3 KB (424 words) - 14:32, 9 September 2020
- ...for sorting lists of data. They are commonly used as an introduction to [[algorithm|algorithms]] for students of [[computer science]].3 KB (470 words) - 15:50, 19 December 2007
- ...i\, \approx\, 3.1419</math>. The method of Archimedes is the first known [[algorithm]] for calculating <math>\scriptstyle\pi</math> with arbitrary accuracy. ...y of new algorithms for doing arithmetic. The discovery of the [[Karatsuba algorithm]] and the [[fast Fourier transform]] (FFT) in the 1960s facilitated multipl15 KB (2,275 words) - 19:45, 1 September 2020
- For many problems, ''f(s)'' is some polynomial in ''s'' for some algorithm that runs on a '''deterministic''' machine — a [[Turing machine]], or ...number of possible answers grows exponentially with problem size, then an algorithm for a deterministic machine that just checks all possible answers sequentia15 KB (2,548 words) - 21:03, 20 August 2010
- ...ion key checks. Inspection of the binary executable file often yielded the algorithm used to generate the registration key, allowing for key generator programs3 KB (423 words) - 02:22, 20 May 2010
- *A theoretical measure of the execution of an algorithm, (e.g. required time or memory) given the problem size ''n'' (e.g. the numb3 KB (474 words) - 15:58, 19 March 2022
- ...ckhoffs'_Principle#Implications_for_analysis | Kerckhoffs' Principle]]; no algorithm should be trusted until it has been published and analysed. If a vendor doe ...pads absolutely require a ''truly random'' key as long as the messages; no algorithm can possibly generate that from a smaller key. A system that generates its6 KB (921 words) - 05:48, 8 April 2024
- ...The equivalence may be expressed by [[formula]]e, geometric concepts or [[algorithm]]s, but in keeping with the modern definition of [[function (mathematics)|m3 KB (477 words) - 17:43, 14 October 2009
- ...employs simulated genotypes in [[genetic programming]] and [[evolutionary algorithm]]s. Such techniques can help [[evolution|evolve]] [[mathematics|mathematic3 KB (441 words) - 14:01, 26 September 2007
- ...e in the [[AES competition]]) and [[Threefish]] (used in the [[Skein (hash algorithm) | Skein hash]], a candidate in the [[AHS competition]]). Except for the na2 KB (377 words) - 05:49, 8 April 2024
- ...org/cgi/content/full/112/24_suppl/IV-19/FIG2 Adult BLS Healthcare Provider Algorithm]--><ref name="pmid16314375_Part_4">{{cite journal |author= |title=2005 Amer ...ontent/122/18_suppl_3/S685/F2.expansion.html Adult BLS Healthcare Provider Algorithm]<ref name="pmid20956221">{{cite journal| author=Berg RA, Hemphill R, Abella18 KB (2,371 words) - 07:46, 19 November 2012
- ...ch a block cipher, or to hash a passphrase to produce a key for it, a hash algorithm with comparable strength is needed. A 256-bit hash is required to give 2<su3 KB (415 words) - 05:48, 8 April 2024
- ...lgorithm increases, how do the running time and memory requirements of the algorithm change?" Computational complexity theory deals with algorithms that are [[ ...size of the input]] (usually measured in bits), using the most efficient [[algorithm]]. To understand this intuitively, consider the example of an instance that17 KB (2,637 words) - 13:14, 6 November 2010
- ...egmentation]], and the corresponding surface is generated by a [[meshing]] algorithm (e.g. [[marching cubes]]) that codifies relationships between [[voxels]] on3 KB (440 words) - 08:31, 1 March 2024
- {{r|Algorithm}}3 KB (441 words) - 12:55, 13 November 2014
- In [[information retrieval]], '''PageRank''' is an algorithm developed by Larry Page and Sergey Brin while at [[Stanford University]].<r3 KB (463 words) - 21:11, 16 April 2009
- ...variable which influences the behavior of a [[cryptography | cryptographic algorithm]]. A [[cipher]] uses an encryption key for encryption and a decryption key3 KB (523 words) - 05:49, 8 April 2024
- ...new key items. This record specifies an encryption algorithm (k=) a hash algorithm (h=) and a public key value (p=). The public key is 216 [[base64]] charact7 KB (1,137 words) - 05:56, 11 December 2009
- ...ind large prime numbers, we must use a systematic procedure — an ''[[algorithm]]''. Nowadays, prime-finding calculations are performed by computers, often ...we have to test all <math>\scriptstyle n-2</math> numbers to be sure. This algorithm can be improved by realizing the following: if ''n'' has a divisor ''a'' th14 KB (2,281 words) - 12:20, 13 September 2013
- ...(pronounced approximately "rhine doll"), from two Belgian designers. That algorithm is now the Advanced Encryption Standard.3 KB (507 words) - 05:48, 8 April 2024
- ...ransactions are equal in load and the servers are equal in capacity. This algorithm assume the transactions are of equal size.<ref name=RFC2391>{{citation ...transaction is proportional to its size, the ''least weighted load first'' algorithm will give better results. This assigns the largest transaction to the least10 KB (1,519 words) - 20:08, 10 June 2010
- Relations may be expressed by [[formula]]e, geometric concepts or [[algorithm]]s, but in keeping with the modern definition of [[function (mathematics)|m4 KB (684 words) - 11:25, 31 December 2008
- The '''fast Fourier transform''' or '''FFT''', is the efficient algorithm for the numerical evaluation of the [[Discrete Fouler transform]] defined w The algorithm of expression of fafo through the FFT is realized through the displacement9 KB (1,368 words) - 11:59, 8 September 2020
- ...], a '''key''' is some set data which, in combination with a cryptographic algorithm, introduces or removes the concealment applied to [[plaintext]] or taken to4 KB (564 words) - 23:12, 4 February 2010
- The [[Advanced Encryption Standard]] or '''AES''' is the algorithm formerly known as '''Rijndael''' (pronounced approximately "rhine doll"). I ...sor named "Threefish", used in the [[Skein (hash algorithm) | Skein]] hash algorithm, a candidate in the [[Advanced Hash Standard]] contest.21 KB (3,252 words) - 05:49, 8 April 2024
- first determine the [[greatest common divisor]] (using the [[Euclidean algorithm]]) and then use4 KB (614 words) - 05:43, 23 April 2010
- ...works, and military applications. Less well-known is that other computer [[algorithm]]s also depend on properties of prime numbers. ...(many hundreds of digits in length) into their prime factors; were a fast algorithm for doing so to be discovered, some of today's most sophisticated ciphers w18 KB (2,917 words) - 10:27, 30 August 2014
- ...hy]] and is defined as "tomography using x-ray transmission and a computer algorithm to reconstruct the image."<ref name="title">{{MeSH}}</ref> The scans can b4 KB (511 words) - 04:22, 10 February 2011
- ...the computation. Second, there is the challenge of developing parallel [[algorithm]]s. In the ideal case, such as in a ray tracer, elements of the problem (p ...output depends on the one before. However, using the BBP digit-extraction algorithm allows digits of Pi to be computed independently, so now the problem has be10 KB (1,485 words) - 22:50, 17 January 2021
- ...| accessyear=2008 }}</ref><ref>{{cite web | title=A Proposed Student Model Algorithm for Student Modeling and its Evaluation | url=http://ieeexplore.ieee.org/Xp An algorithm for a CAT-style assessment is simple to implement. A large pool of questio13 KB (1,938 words) - 10:30, 29 August 2008
- The '''International Data Encryption Algorithm''' or '''IDEA'''4 KB (558 words) - 05:49, 8 April 2024
- which, via Euclid algorithm, leads to:5 KB (743 words) - 13:10, 27 July 2008
- | title = Measurement of Cortical Thickness Using an Automated 3-D Algorithm: A Validation Study4 KB (516 words) - 08:55, 15 January 2010
- ...traffic. AES was selected in an [[AES competition |open process]], and its algorithm is public.<ref name=Burr>{{citation | title = Lucifer, A Cryptographic Algorithm16 KB (2,456 words) - 05:48, 8 April 2024
- ...that I have. I believe, the professional programmers can do it better. The algorithm is described in the reference below. Use for free, attribute the source. [[9 KB (685 words) - 00:55, 25 November 2012
- ...s below IP have much stronger error detection capability than the Fletcher algorithm used in IPv4. IPv6 recognized that this field is of little practical value End-to-end protocols above IPv4 use the same checksum algorithm, but they look at the overall data being delivered, not just the header. Si9 KB (1,543 words) - 16:22, 30 March 2024
- ...latter case, [[pseudorandom numbers]] are generated, which are based on an algorithm, depending on the type of Unix system.4 KB (692 words) - 19:24, 26 July 2008
- ...ons give raise to a recursive procedure, called the [[deletion–contraction algorithm]]. In the recursive step, the instance is transformed into two instances th ...lynomial is [[Sharp-P-complete]], so it is unlikely that a polynomial time algorithm for all graphs will be found.14 KB (2,315 words) - 00:35, 9 February 2010
- The [[Template method pattern]] defines the skeleton of an algorithm as an abstract class, allowing its subclasses to provide concrete behavior. [[Visitor pattern]] separates an algorithm from an object structure by moving the hierarchy of methods into one object9 KB (1,310 words) - 20:48, 15 December 2020
- ...tructions and data (idea now recognized as not created by JVN), merge sort algorithm, cellular automata4 KB (515 words) - 09:39, 10 November 2008
- ...and insertion of ''et al.'' Probably suited to a future automatic software algorithm for Pubmed conversion.==== But using link to algorithm engin provided by Gareth , that is [http://diberri.dyndns.org/wikipedia/cit14 KB (2,224 words) - 18:31, 16 August 2013
- # dijkstra59v05_A.py Dijkstra's Algorithm DMQ 12/23/09 Use Dijkstra's algorithm to compute the shortest paths from a given source node13 KB (1,880 words) - 03:32, 3 February 2011
- * The [[RSA algorithm]] for [[public key]] cryptography, from [[Ron Rivest]], [[Adi Shamir]] and5 KB (823 words) - 20:23, 19 September 2011
- ...It was finally recognized in the 19th century that secrecy of a cipher's algorithm is not a sensible, nor practical, safeguard: in fact, any adequate cryptogr ...e = Nov. 1976}} pages = 644-654</ref> and the public release of the [[RSA algorithm]]. Since then, cryptography has become a widely used tool in communications9 KB (1,312 words) - 05:49, 8 April 2024
- which makes it easy to SEE what might be wrong with an algorithm. As Joe Armstrong6 KB (736 words) - 00:57, 6 February 2010
- ...e times, something that would be physically impossible with an exponential algorithm). Also, the effects of Moore's Law do not help the situation much because d14 KB (2,099 words) - 13:37, 10 April 2024
- First the Euler ''z-y-x''-parametrization will be proved by an algorithm for the factorization of a given matrix '''R''' ≡ ('''r'''<sub>1</sub '':A Fortran subroutine based on the algorithm is given on the [[Euler_angles/Code|code page]].''16 KB (2,502 words) - 12:28, 24 March 2010
- {{r|Algorithm (finance)}}6 KB (784 words) - 05:38, 17 December 2012
- ...ollution dispersion on small spatial scales, within the Netherlands. The [[algorithm]]s and [[parameter]]s contained in the CALM model are practically identical5 KB (677 words) - 17:02, 18 February 2010
- * '''An Algorithm''' - this will combine background and input information to arrive at the re ...recommendation systems' data sources are put into a single recommendation algorithm.12 KB (1,657 words) - 06:58, 23 July 2012
- irrationality.</ref> [[Euclid]] gave an algorithm for computing the ...that would correspond to the medieval era in Europe. [[Aryabhata]] gave an algorithm for solving<ref name="Aryabhata">Āryabhaṭa,27 KB (4,383 words) - 08:05, 11 October 2011
- Ciphers apply an algorithm and a [[cryptographic key]] to [[plaintext]] in the form of digitally encod Transposition also has keys. A general pairwise transposition algorithm switches pairs of letters. This key exchanges every second letter; a differ12 KB (1,744 words) - 05:48, 8 April 2024
- ...ned change in connection weights over time is referred to as the "learning algorithm". ...1980s, is probably the most commonly known connectionist gradient descent algorithm today.16 KB (2,332 words) - 07:08, 26 September 2007
- ...utcome from published voting information, then those members must trust an algorithm they neither understand nor are able to execute. This would have a chilling ...vote tallying algorithm (and taking the time to learn and understand that algorithm) is not something I wish to do. I imagine many others feel the same way.51 KB (8,256 words) - 10:37, 20 January 2014
- }}</ref>. Another document with broad scope is RFC 4835 "Cryptographic Algorithm Implementation Requirements for Encapsulating Security Payload (ESP) and A | title = Cryptographic Algorithm Implementation Requirements for Encapsulating Security Payload (ESP) and A40 KB (6,219 words) - 05:49, 8 April 2024
- on the [[RSA algorithm]] for [[public key]] cryptography.5 KB (793 words) - 05:49, 8 April 2024
- While only few modes are excited, there is no need to use the special algorithm; the explicit formula is also fast.8 KB (1,204 words) - 18:09, 8 September 2020
- ...ion of the PRIME Plume Rise and Building Downwash Model]</ref> which is an algorithm for modeling the effects of [[Air pollution dispersion terminology|downwas6 KB (799 words) - 17:46, 12 October 2009
- ...ents according to similarity on their responses to a survey. A brute force algorithm, testing all students against each other, the program computed difference s ...uestionnaire-based as well. They hired a programmer for $100 to code their algorithm and charged student $3 for 5 guaranteed matches. By 1966, Operation Match w23 KB (3,464 words) - 11:48, 2 February 2023
- </ref>, Knuth contributed significantly to the analysis of [[Algorithm|algorithms]]. He is also known for having created the [[TeX]] typesetting7 KB (1,029 words) - 07:21, 30 September 2007
- ..., and have it be tested for being empty from the inside, go ahead. If your algorithm needs a sequence of items, but you need to use a generator to simulate the6 KB (958 words) - 22:25, 25 January 2011
- The ADMS 4 model includes [[algorithm]]s which take into account: [[Air pollution dispersion terminology|downwash7 KB (1,030 words) - 11:53, 2 February 2023
- ...ming language]], though it could be any unambiguous representation of an [[algorithm]], such as a [[flow chart]] or other representation of a [[finite state mac7 KB (933 words) - 16:53, 16 February 2010
- ...otocol Field (value must be 3), a 1 octet field defining the cryptographic algorithm in use, and the Public Key Field. | key tag, algorithm number, and a digest of the DNSKEY RR.13 KB (2,037 words) - 16:22, 30 March 2024
- ...'''system''' could also be a [[Method (computer science)|method]] or an [[algorithm]]. Again, an example will illustrate: There are systems of counting, as wit7 KB (1,049 words) - 22:04, 14 February 2010
- ...of the hand using the [[Bayes statistical model]]. 3D gesture recognition algorithm can identify where a person is pointing at based on the relative positions20 KB (3,112 words) - 08:33, 22 August 2013
- ...of the hand using the [[Bayes statistical model]]. 3D gesture recognition algorithm can identify where a person is pointing at based on the relative positions20 KB (3,127 words) - 05:22, 15 September 2013
- ...ture and can be modeled on a computer by using a [[recursion|recursive]] [[algorithm]]. This recursive nature is obvious in these examples — a branch from ...ecreasing at each iteration the range by half. The recursive nature of the algorithm guarantees that the whole is statistically similar to each detail.14 KB (2,043 words) - 12:19, 11 June 2009
- | Anderson [[Pharmacogenomics|pharmacogenetic]]-guided algorithm || Based on ''[[CYP2C9]]'' and ''[[VKORC1]]''|| Anderson†<ref name="pmid1 | Caraco [[Pharmacogenomics|pharmacogenetic]]-guided algorithm || Based on ''[[CYP2C9]]''|| Caraco<ref name="pmid17851566"/>||align="cente52 KB (7,136 words) - 22:53, 6 April 2014
- ...so known as the ''[[Newton-Raphson method]]'') is an efficient iterative [[algorithm]] for solving the Rachford-Rice equation. Alternatively, the [[bisection me9 KB (1,381 words) - 08:26, 1 September 2013
- .../pmidlookup?view=short&pmid=15496625&promo=ONFLNS19 |issn=}}<br>Diagnostic algorithm at http://content.nejm.org/cgi/content/full/351/17/1764/F1</ref> recommend14 KB (1,909 words) - 08:31, 14 October 2013
- ...ion might allow fewer rounds; for example, [[International Data Encryption Algorithm| IDEA]] uses only 8 rounds. Since the ciphers with fast round functions gen ...ssey]], in a cipher which later became the [[International Data Encryption Algorithm]], IDEA.<ref name=idea>{{citation53 KB (8,371 words) - 05:48, 8 April 2024
- |event='''1990''': [[BLAST algorithm]] developed to align DNA sequences and is the key to comparative genomics.8 KB (1,066 words) - 11:36, 15 September 2013
- ...so known as the ''[[Newton-Raphson method]]'') is an efficient iterative [[algorithm]] for solving the Rachford-Rice equation. Alternatively, the [[bisection me9 KB (1,404 words) - 02:16, 27 October 2013
- '''Message Digest''' algorithm number 4 was from [[Ron Rivest]]. It is no longer used, replaced by its des ...on SHA-1, though these are not applicable against all applications of the algorithm. If SHA-1 behaved as an ideal hash, the cost of finding a collision would b16 KB (2,641 words) - 15:51, 8 April 2024
- ...ing from division of ''a'' by ''b''. This is the basis for the [[Euclidean algorithm]] for computing [[greatest common divisor]]s.10 KB (1,566 words) - 08:34, 2 March 2024
- ...a competent programmer feels pretty free to implement any well-understood algorithm provided that the time permits (which is usually most problematic) and the ...rors, and still expect to be understood. Pseudocode is a description of an algorithm, intended for human reading, that can be converted into a code by any compe34 KB (5,174 words) - 21:32, 25 October 2013
- In theory, any [[hash (cryptography) | hash algorithm]] could be used to construct a stream cipher by repeatedly hashing some sor ...able property in a cipher. For an LFSR of length L, the [[Berlekamp-Massey algorithm]] can determine the register's internal state from 2L output bits. XORing t24 KB (3,851 words) - 05:49, 8 April 2024
- | title = The MacGuffin Block Cipher Algorithm ...r=Nikita Borisov, Ian Goldberg, and David Wagner|title=Security of the WEP algorithm|url=http://www.isaac.cs.berkeley.edu/isaac/wep-faq.html}}</ref>52 KB (8,332 words) - 05:49, 8 April 2024
- ...uk B, Yu E et al.| title=Safety and efficiency of a chest pain diagnostic algorithm with selective outpatient stress testing for emergency department patients8 KB (1,069 words) - 12:25, 5 June 2014
- ...Under this Phase I Project, the feasibility of implementing this advanced algorithm for operational use in Phase II will be established.8 KB (1,181 words) - 15:31, 4 April 2024
- | title = On the Security of the CAST Encryption Algorithm9 KB (1,452 words) - 05:49, 8 April 2024
- ...of all the above, it is very unlikely to be able to find a reasonably fast algorithm for playing go endgames flawlessly, let alone the whole go game. <ref>See [ ...More recently, [[Artificial neural network|neural networks]] and [[genetic algorithm]]s are being looked at as an alternative approach.26 KB (4,194 words) - 05:43, 13 March 2020
- ...atmospheric and illumination conditions by taking them out. The Invariant Algorithm for target detection was designed to find many possible combinations of the | title = Performance Analysis of the Invariant Algorithm for Target Detection in Hyperspectral Imagery19 KB (2,668 words) - 12:26, 22 March 2024
- Early versions of search [[algorithm]]s relied on webmaster-provided information such as the keyword [[meta tag] ...lgorithm to rate the prominence of web pages. The number calculated by the algorithm, [[PageRank]], is a function of the quantity and strength of [[inbound link37 KB (5,577 words) - 18:32, 10 October 2013
- ...g the [[Box-Muller transform]]. An even faster algorithm is the [[ziggurat algorithm]]. The Box-Muller algorithm says that, if you have two numbers ''a'' and ''b'' [[uniform distribution|u46 KB (6,956 words) - 07:01, 9 June 2009
- * [[Gillespie algorithm]]12 KB (1,781 words) - 14:50, 7 December 2008
- # There are a few versions of this algorithm9 KB (1,386 words) - 09:02, 2 March 2024
- In particular, he gave an algorithm for computing the greatest common divisor of two numbers (the [[Euclidean algorithm]]; ''Elements'', Prop. VII.2) and the first known proof of the [[infinitude35 KB (5,526 words) - 11:29, 4 October 2013
- ...algorithm can possibly meet the required condition''. A non-deterministic algorithm to generate a pad from a key would not give a useful cipher; the recipient,12 KB (1,878 words) - 05:48, 8 April 2024
- ..., Paul E.|accessdate=2007-05-14}}</ref>. The difference engine's physical algorithm was based on a mathematical technique known as the Method of Differences, w ...nse, the Analytical Machine was much like a computer, having an input (the algorithm as described on a card), a processor (the machine), an output (the result),26 KB (3,913 words) - 06:51, 7 April 2014
- ..., some with challenges. The adoption of a Belgian-developed [[encryption]] algorithm, approved in a public process, and accepted both for sensitive but unclassi That the algorithm chosen came from Europe points to a more multilateral world with respect to21 KB (2,986 words) - 06:04, 8 April 2024
- In theory, any high-grade compression algorithm could be substituted for the hash provided any non-random headers are throw Consider an algorithm that looks at pairs of bytes and creates a 256x256 matrix for frequencies o23 KB (3,650 words) - 05:49, 8 April 2024
- Various search algorithm| search algorithms have been used for FIB lookup. While well-known general12 KB (1,828 words) - 16:22, 30 March 2024
- ...roduction of the Hammond tone. Some sophisticated emulation devices have [[algorithm]]s that recreate some of the characteristics of the vintage Hammonds, such10 KB (1,645 words) - 09:14, 2 March 2024
- ...e of <math>W(z)</math> can be calculated by using a regular [[root-finding algorithm]] to solve the equation <math>we^w-z=0</math> for <math>w</math>. Since the14 KB (2,354 words) - 21:43, 25 September 2011
- ...y (tests)|specificity]]. In the United States, this is achieved using an [[algorithm]] combining two tests for HIV antibodies. If antibodies are detected by an ...not been evaluated. These tests should be used in appropriate multi-test [[algorithm]]s designed for statistical validation of rapid HIV test results.26 KB (3,990 words) - 13:22, 2 February 2023
- ...nation]]. It was a simulation of 12 [[hard spheres]] using a [[Monte Carlo algorithm]]. Computer simulation is often used as an adjunct to, or substitution for,14 KB (1,986 words) - 17:07, 22 March 2024
- ...on models|dispersion models]], that solve the mathematical equations and [[algorithm]]s which simulate the pollutant dispersion. The dispersion models are used15 KB (2,295 words) - 11:45, 2 February 2023
- ...on models|dispersion models]], that solve the mathematical equations and [[algorithm]]s which simulate the pollutant dispersion. The dispersion models are used15 KB (2,338 words) - 11:43, 2 February 2023
- ...e_microbialgenomes_nocobwebs.jpg|right|frame|Tree Based on the Median Tree Algorithm. <ref>Ge F ''et al'' The cobweb of life revealed by genome-scale estimates13 KB (2,052 words) - 06:27, 15 September 2013
- ...ny different computer programs developed worldwide that use mathematical [[algorithm]]s to simulate how air [[pollutant]]s in the ambient [[atmosphere]] dispers ...urce screening model with terrain adjustment that uses the plume impaction algorithm of the VALLEY model.35 KB (5,287 words) - 21:27, 15 December 2013
- ...partially the result of the influence of other attributes. The statistical algorithm deconstructs the rating (called a raw score) into its various components, a16 KB (2,339 words) - 19:24, 29 September 2020
- ...r security from the difficulty of a mathematical problem — the [[RSA algorithm]] from [[integer factorisation]], the [[Diffie-Hellman]] protocol from the }}</ref> defeat [[RSA algorithm|RSA]] and other [[public key]] systems.32 KB (4,913 words) - 14:38, 18 March 2024
- ...awford admits that this is a subjective test. Some games with noticeably [[algorithm]]ic [[artificial intelligence]] can be played as puzzles; these include the15 KB (2,385 words) - 08:14, 22 April 2023
- ...r security from the difficulty of a mathematical problem — the [[RSA algorithm]] from [[integer factorisation]], the [[Diffie-Hellman]] protocol from the }}</ref> defeat [[RSA algorithm|RSA]] and other [[public key]] systems.32 KB (4,916 words) - 05:49, 8 April 2024
- The algorithm should be clear now. For instance, to decompose the 135-dimensional space b22 KB (3,334 words) - 05:36, 6 March 2024
- * {{search link|algoritm||ns0|ns14|ns100}} ([[algorithm]])29 KB (3,711 words) - 21:03, 24 March 2011
- ...er is said to be ''[[computable number|computable]]'' if there exists an [[algorithm]] that yields its digits. Because there are only [[Countable set|countably]19 KB (2,948 words) - 10:07, 28 February 2024
- ...k L |title=Effectiveness of managing suspected pulmonary embolism using an algorithm combining clinical probability, D-dimer testing, and computed tomography |j ...M, Sprayregen S, Davitt MM, Freeman LM| title=Success of a safe and simple algorithm to reduce use of CT pulmonary angiography in the emergency department. | jo56 KB (7,879 words) - 10:57, 8 March 2024
- ...non-continuous air pollution plumes (called ''puff models''). The primary algorithm used in Gaussian modeling is the ''Generalized Dispersion Equation For A Co19 KB (2,906 words) - 10:19, 30 July 2023
- ...non-continuous air pollution plumes (called ''puff models''). The primary algorithm used in Gaussian modeling is the ''Generalized Dispersion Equation For A Co19 KB (2,906 words) - 10:19, 30 July 2023
- A 'practical' algorithm for management has been proposed.<ref name="pmid23460160">{{cite journal| a20 KB (2,787 words) - 16:37, 3 November 2013
- The confusion assessment method (CAM), which is an algorithm with four criteria based on the [[Diagnostic and Statistical Manual of Ment20 KB (2,716 words) - 09:45, 26 December 2016
- ...ietary standard truly scares the competition. IS-IS, while sharing age and algorithm with OSPF, developed in a different standards body, when not only the [[Ope23 KB (3,713 words) - 12:20, 30 March 2024
- ...rett PM, Rachakonda KS, Stephens D, Harrigan P et al.| title=Procalcitonin algorithm in critically ill adults with undifferentiated infection or suspected sepsi21 KB (2,985 words) - 18:51, 17 February 2015
- ...ing, or truncating, words by removing suffixes may help.<ref>Porter MF. An algorithm for suffix stripping. Program. 1980;14:130–7.</ref> ...ovic JR, Iyengar MS, Bernstam EV |title=Using hit curves to compare search algorithm performance |journal=J Biomed Inform |volume=40 |issue=2 |pages=93–9 |yea42 KB (5,875 words) - 11:11, 29 March 2012
- ...apes that would require more than four colors. Then they applied various [[algorithm]]s showing that these configurations suggested that no minimal counter-exam22 KB (3,572 words) - 03:09, 8 March 2024
- Bollen ''et al''. proposed using the [[PageRank]] algorithm used by [[Google]] to distinguish the "quality" of citations and hence impr20 KB (2,885 words) - 17:52, 3 November 2013
- ...utline, and the calculation of the position of the cutlines slows down the algorithm of evaluation of slog. In addition, ...on of any of these superlogarithms, it is sufficient to have the efficient algorithm for the evaluation in this domain.65 KB (10,203 words) - 04:16, 8 September 2014
- Clipper was widely criticized for cryptographic reasons. The cipher algorithm was classified, which violates [[Kerckhoffs' Principle]]; no cipher should20 KB (2,946 words) - 05:49, 8 April 2024
- ...tice, since there are faster convergent methods, like the [[Newton-Raphson algorithm]].32 KB (4,192 words) - 18:42, 3 March 2024
- ...al |author=Manley SE, Sikaris KA, Lu ZX, ''et al'' |title=Validation of an algorithm combining haemoglobin A(1c) and fasting plasma glucose for diagnosis of dia ...|title=Medical management of hyperglycemia in type 2 diabetes: a consensus algorithm for the initiation and adjustment of therapy: a consensus statement of the98 KB (13,470 words) - 13:28, 10 February 2023
- gives a sorted list of people but does not specify the type of sorting algorithm used. One could argue that libraries of functions that abstract out the det25 KB (3,897 words) - 01:49, 8 October 2013
- ...age instructions]] peculiar to a particular computer, a translation of the algorithm into specific tiny steps that particular computer can handle, .<ref name=Ed ...to do. "One reason that these criteria do not supply [constitute] a choice algorithm is that, in live [ongoing] cases of theory choice, and particularly during82 KB (12,424 words) - 15:58, 2 August 2016
- ...hat lack [[arithmetic and logical unit|hardware multiplier]]s, there is an algorithm called [[CORDIC]] (as well as related techniques) that is more efficient, s33 KB (5,179 words) - 08:26, 4 June 2010
- ...implements in electronics the same method — in computer terminology, an [[algorithm]] — to add two numbers together that children are taught — add one colu25 KB (3,906 words) - 12:07, 22 February 2009
- ...huk B, Yu E et al.| title=Safety and efficiency of a chest pain diagnostic algorithm with selective outpatient stress testing for emergency department patients31 KB (4,213 words) - 07:18, 28 March 2023
- ...y that the mind is separate from the brain in the same way that a computer algorithm exists independent of its many possible realizations in coding and physical28 KB (4,259 words) - 10:27, 1 April 2024
- ...of [[neuroinformatics]], which is concerned with developing and adapting [[algorithm]]s to analyze those data. </onlyinclude>27 KB (3,842 words) - 07:31, 20 April 2024
- ...o relied heavily on the then-new technique of ''[[prosthaphaeresis]]'', an algorithm for approximating products based on trigonometric identities that predated23 KB (3,568 words) - 10:30, 2 April 2024
- ...or DRM scheme used on commercial DVDs which uses a 40-bit stream cipher [[algorithm]] which was initially introduced around 1996. It was [[reverse engineering|28 KB (4,091 words) - 11:48, 2 February 2023
- ...brain mechanisms—but as yet has been met with limited success. Creating [[algorithm]]s to mimic a biological brain is very difficult because the brain is not a27 KB (3,997 words) - 10:27, 1 April 2024
- ...ver, NSA IPsec implementations that use some non-AES classified encryption algorithm? I certainly wouldn't bet against it; the documents are usually fairly care66 KB (10,879 words) - 17:02, 5 March 2024
- ...some concern because NSA required that the theory of some parts of the DES algorithm remain classified. ...or. Eventually, it was learned that the reason was that the details of the algorithm revealed a vulnerability to, and countermeasures against, a then-classified60 KB (8,909 words) - 18:47, 3 April 2024
- ...rresponds to the concept of "unsupervised" [[machine learning]], where the algorithm looks for patterns in data without being instructed about the actual catego30 KB (4,318 words) - 11:09, 21 November 2020
- ...y that the mind is separate from the brain in the same way that a computer algorithm exists independent of its many possible realizations in coding and physical ...nguage]] instructions peculiar to a particular computer by translating the algorithm into steps that particular computer can handle, some aspects of the univers93 KB (14,229 words) - 19:42, 6 February 2016
- * [[Naranjo algorithm]]25 KB (3,396 words) - 13:29, 2 April 2024
- The general approach, when a MAC address is available, is to follow an algorithm to produce an [[IEEE]]-defined, 64-bit EUI64 identifier from a 48 bit IEEE39 KB (5,823 words) - 12:18, 30 March 2024
- ...ovic JR, Iyengar MS, Bernstam EV |title=Using hit curves to compare search algorithm performance |journal=J Biomed Inform |volume=40 |issue=2 |pages=93–9 |yea47 KB (6,522 words) - 15:13, 27 December 2013
- ...ional vulnerability of an encryption device, not related to the encryption algorithm.<ref name=>{{citation36 KB (5,247 words) - 05:49, 8 April 2024
- ...analyzing the spoken input the HMM has proven to be successful because the algorithm takes into account a language model, an acoustic model of how humans speak,34 KB (5,058 words) - 15:11, 9 August 2020
- Adam Back wrote a version of the RSA algorithm for public key cryptography in three lines of Perl <ref>{{citation35 KB (5,430 words) - 07:27, 18 March 2024
- ..., some with challenges. The adoption of a Belgian-developed [[encryption]] algorithm, approved in a public process, and accepted both for sensitive but unclassi That the algorithm chosen came from Europe points to a more multilateral world with respect to72 KB (10,689 words) - 05:49, 8 April 2024
- An alternative scale is the [[Naranjo algorithm]].39 KB (5,361 words) - 17:35, 10 February 2024
- ...bined use of proton-proton overhauser enhancements and a distance geometry algorithm for determination of polypeptide conformations. Application to micelle-boun41 KB (6,350 words) - 04:54, 21 March 2024
- .... Worrall points out "One reason why these criteria do not supply a choice algorithm is that in live cases of theory choice, and, in particular, during scientif44 KB (6,711 words) - 20:01, 11 October 2013
- ...e achieved using views, generally based on variations of the [[MapReduce]] algorithm.46 KB (7,002 words) - 07:32, 18 September 2010
- ...ey-Cox J, Coupland C| title=Derivation and validation of updated QFracture algorithm to predict risk of osteoporotic fracture in primary care in the United King49 KB (6,739 words) - 13:28, 10 February 2023
- ...thod is global, it uses the entire dataset to form the model, or local, an algorithm is repeated for a small section of terrain.41 KB (6,343 words) - 17:02, 22 March 2024
- ...infected one's computer system, not a biological virus but by an encoded [[algorithm]] that behaves like one;<ref name=knowles2006>Knowles M, Moon R. (2006) ''I54 KB (8,348 words) - 17:59, 20 May 2016
- ...rrogate the individual human system before running its lifespan-predicting algorithm. And do such interrogation time after time as time goes by. One would want48 KB (7,109 words) - 14:33, 19 August 2014
- ...automatons, thinking and acting as if they were following the steps of an algorithm. Carr believed that the film's prophetic message was that as individuals in57 KB (8,658 words) - 15:04, 15 April 2024
- ...frame sizes, etc. However, improvements were made, and the actual MUSICAM algorithm was not used in the final MPEG-1 Layer II audio standard. The widespread u60 KB (8,883 words) - 02:16, 18 November 2009
- :::#Fitch-Margoliash Little Maximum Parsimony Algorithm for Phylogenetic Tree Construction46 KB (6,635 words) - 13:25, 14 April 2021
- ...osmi B, Ghirarduzzi A et al.| title=Safety and Feasibility of a Diagnostic Algorithm Combining Clinical Probability, d-Dimer Testing, and Ultrasonography for Su71 KB (9,981 words) - 10:49, 8 March 2024
- * "The algorithm does not apply to patients who require emergency noncardiac surgery, or to81 KB (10,863 words) - 17:35, 10 February 2024
- ...itself, independently of a master controller, program director, blueprint, algorithm, or template. ...into proteins describes an algorithm — the transcription-translation algorithm, including its regulatory circuits. Inasmuch as those algorithms evolved th194 KB (28,649 words) - 05:43, 6 March 2024
- The most important mathematical challenge of chess is the development of [[algorithm]]s which can play chess. The idea of creating a chess playing machine date64 KB (10,049 words) - 07:31, 20 April 2024
- ...into proteins describes an algorithm — the transcription-translation algorithm, including its regulatory circuits. Inasmuch as those algorithms evolved th150 KB (22,449 words) - 05:42, 6 March 2024