Search results
Jump to navigation
Jump to search
Page title matches
- == Distributed algorithms == ...2 KB (343 words) - 09:13, 12 January 2011
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Approximate counting, linear programming]] ...90 bytes (8 words) - 08:41, 18 May 2010
- == Approximation Algorithms == ;Approximation algorithms ...20 KB (3,484 words) - 05:14, 11 June 2010
- Randomized Algorithms |image = [[File:MR-randomized-algorithms.png|100px]] ...1 KB (108 words) - 05:26, 27 May 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Randomized approximation algorithms]] ...85 bytes (7 words) - 12:31, 27 May 2010
- 47 bytes (2 words) - 07:38, 13 October 2011
- 40 bytes (2 words) - 10:16, 25 February 2013
- 104 bytes (10 words) - 07:55, 24 December 2009
- 197 bytes (22 words) - 16:21, 31 December 2009
- Randomized Algorithms |image = [[File:MR-randomized-algorithms.png|100px]] ...12 KB (1,315 words) - 03:37, 18 July 2011
- 38 bytes (2 words) - 06:59, 3 September 2011
- 63 bytes (4 words) - 12:41, 13 September 2010
- 39 KB (7,173 words) - 03:22, 4 November 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Course materials]] ...66 bytes (6 words) - 08:27, 26 December 2009
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Course materials]] ...66 bytes (6 words) - 08:32, 26 December 2009
- * '''[MR]''' Rajeev Motwani and Prabhakar Raghavan, ''Randomized Algorithms''. Cambridge University Press, 1995. ...n, Charles Leiserson, Ronald Rivest, and Clifford Stein. ''Introduction to Algorithms'', 2nd edition. MIT Press, 2001. ...2 KB (132 words) - 11:58, 11 January 2010
- ...ized algorithms look like. Two basic principles are used to analyze these algorithms: linearity of expectations, and independence of events. ...ant classes of randomized algorithms: Las Vegas algorithms and Monte Carlo algorithms. I will introduce their definitions at the end of this lecture. ...16 KB (2,893 words) - 08:43, 7 June 2010
- 2 KB (19 words) - 13:09, 18 January 2010
- ...lexity model, the local computational costs are ignored. The complexity of algorithms (also called communication protocols here) are measured by the number of bi ...20 KB (3,617 words) - 01:24, 8 June 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Balls and bins]] ...64 bytes (7 words) - 13:37, 12 March 2010
- 3 KB (73 words) - 00:45, 10 July 2010
- * For Metropolis algorithms which generate uniform stationary distribution, <math>P_{uv}</math> are equ ...28 KB (4,914 words) - 08:26, 7 June 2010
- 30 KB (5,292 words) - 07:49, 3 August 2011
- #REDIRECT [[Randomized Algorithms (Spring 2010)/class announcements]] ...69 bytes (6 words) - 05:36, 27 May 2010
- 3 KB (573 words) - 17:09, 31 May 2010
- 2 KB (373 words) - 01:23, 29 June 2010
- 4 KB (687 words) - 12:48, 29 March 2010
- ...s a very simple scheme for boosting the accuracy of Monte Carlo randomized algorithms with two-sided errors. ...5 KB (842 words) - 01:10, 30 March 2010
- Today's materiels are the common senses for randomized algorithms. ...34 KB (5,979 words) - 13:52, 20 September 2010
- :Consider the theorem of large independent set in [[Randomized Algorithms (Spring 2010)/The probabilistic method|Lecture 8]]. The proof of the theore ...3 KB (592 words) - 14:37, 19 April 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Random sampling]] ...65 bytes (6 words) - 11:14, 17 May 2010
- ;Oblivious routing algorithms ...ven more oblivious than this standard definition.) Compared to the routing algorithms which are adaptive to the path that the packet traversed, oblivious routing ...31 KB (5,481 words) - 03:52, 9 November 2010
- ...such an object. This kind of proofs can be interpreted as ''deterministic algorithms'' which find the object with desirable properties. ...33 KB (6,039 words) - 08:41, 7 June 2010
- 3 KB (555 words) - 12:38, 19 May 2010
- In [[Randomized Algorithms (Spring 2010)/Tail inequalities|lecture 4]], we show the following theorem ...f hash tables is now considered to be the birth of the area of analysis of algorithms. ...42 KB (7,662 words) - 08:41, 7 June 2010
- ...The argument uses an important principle for the probabilistic analysis of algorithms: the principle of deferred decisions. ...ortant idea called '''random walks'''. There is a huge class of randomized algorithms for random sampling based on this principle. ...29 KB (4,994 words) - 01:21, 29 August 2011
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Balls into bins]] ...65 bytes (7 words) - 14:00, 11 March 2010
- ...ions <math>f:\{0,1\}^*\rightarrow\mathbb{N}</math> computable by poly-time algorithms. The classes '''FP''' and '''#P''' are the analogs of '''P''' and '''NP''' For deterministic algorithms, there are negative news for this problem. ...37 KB (6,579 words) - 08:26, 7 June 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Approximate counting, linear programming]] ...90 bytes (8 words) - 19:59, 24 May 2010
- ...ters of random walks are closely related to the performances of randomized algorithms based on random walks: ...37 KB (6,516 words) - 08:40, 7 June 2010
- Last time we talked about algorithms. Today's topic is '''complexity'''. ; Complexity of algorithms ...25 KB (4,263 words) - 08:43, 7 June 2010
- ...raphs] have found extensive applications in computer science, in designing algorithms, [http://en.wikipedia.org/wiki/Error_correcting_code error correcting codes ...te. Studies of these two problems revolutionized the area of approximation algorithms. ...35 KB (6,195 words) - 08:39, 7 June 2010
Page text matches
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Randomized approximation algorithms]] ...85 bytes (7 words) - 12:31, 27 May 2010
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...1 KB (152 words) - 13:53, 5 September 2022
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...1 KB (155 words) - 13:59, 5 September 2022
- Randomized Algorithms |image = [[File:MR-randomized-algorithms.png|100px]] ...1 KB (108 words) - 05:26, 27 May 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Course materials]] ...66 bytes (6 words) - 08:32, 26 December 2009
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Course materials]] ...66 bytes (6 words) - 08:27, 26 December 2009
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...1 KB (159 words) - 00:15, 2 September 2019
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...1 KB (159 words) - 01:48, 31 August 2016
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...1 KB (159 words) - 05:43, 3 September 2018
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...1 KB (159 words) - 08:13, 1 August 2017
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Balls into bins]] ...65 bytes (7 words) - 14:00, 11 March 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Random sampling]] ...65 bytes (6 words) - 11:14, 17 May 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/class announcements]] ...69 bytes (6 words) - 05:36, 27 May 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Balls and bins]] ...64 bytes (7 words) - 13:37, 12 March 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Approximate counting, linear programming]] ...90 bytes (8 words) - 08:41, 18 May 2010
- #REDIRECT [[Randomized Algorithms (Spring 2010)/Approximate counting, linear programming]] ...90 bytes (8 words) - 19:59, 24 May 2010
- * '''[MR]''' Rajeev Motwani and Prabhakar Raghavan, ''Randomized Algorithms''. Cambridge University Press, 1995. ...n, Charles Leiserson, Ronald Rivest, and Clifford Stein. ''Introduction to Algorithms'', 2nd edition. MIT Press, 2001. ...2 KB (132 words) - 11:58, 11 January 2010
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...2 KB (231 words) - 06:43, 14 September 2023
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...2 KB (164 words) - 15:02, 22 February 2013
- |[[File:MR-randomized-algorithms.png|border|100px]] :'''''Randomized Algorithms'''''. ...2 KB (177 words) - 04:10, 17 February 2014
- ...n.jpeg|border|100px]]||P. J. Cameron. ''Combinatorics: Topics, Techniques, Algorithms.'' Cambridge University Press, 1995. ...00px]]||R. Sedgewick and P. Flajolet. ''An Introduction to the Analysis of Algorithms.'' Addison-Wesley, 1995. ...3 KB (186 words) - 08:56, 16 August 2011
- |[[File:MR-randomized-algorithms.png|border|100px]]|| :'''''Randomized Algorithms'''''. ...3 KB (240 words) - 14:31, 21 July 2011
- * Advanced Algorithms: [[高级算法 (Fall 2023)|Fall 2023]], [[高级算法 (Fall 2022)|Fall 2022]], [[高级算法 (Fa ...(Spring 2013)|Spring 2013]], [[随机算法 (Fall 2011)|Fall 2011]], [[Randomized Algorithms (Spring 2010)|Spring 2010]]. ...3 KB (214 words) - 15:53, 19 March 2024
- Randomized Algorithms |image = [[File:MR-randomized-algorithms.png|100px]] ...12 KB (1,315 words) - 03:37, 18 July 2011
- <br>Advanced Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...8 KB (653 words) - 10:21, 12 September 2017
- * Vijay Vazirani. ''Approximation Algorithms''. Springer, 2004. * David Williamson and David Shmoys. ''The Design of Approximation Algorithms''. Cambridge Univ Press, 2011. ...4 KB (455 words) - 07:53, 28 December 2011
- An '''algorithm''' is a fancy to-do list for a [[computer]]. Algorithms take in zero or more inputs and give back one or more outputs. ...n be called a "list of steps". This is nice, but it doesn't say much about algorithms. ...10 KB (1,837 words) - 21:56, 31 August 2017
- <br>Advanced Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...10 KB (797 words) - 08:56, 13 January 2021
- <br>Advanced Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...8 KB (734 words) - 08:36, 8 January 2020
- ; Complexity of algorithms ...refer to the bounds of the complexities of problems, rather than those of algorithms. ...11 KB (1,828 words) - 06:00, 27 August 2011
- 651 bytes (97 words) - 01:50, 28 July 2013
- = The simplex algorithms = ...y steps to reach the optimum. The simplex algorithm is actually a class of algorithms defined by various '''pivoting rules''', which describe how to move locally ...6 KB (1,029 words) - 09:37, 6 November 2011
- <br>Advanced Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...7 KB (597 words) - 11:40, 26 December 2018
- <br>Advanced Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...13 KB (1,313 words) - 05:54, 11 October 2022
- <br>Advanced Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...13 KB (1,303 words) - 18:51, 5 January 2023
- <br>Advanced Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...7 KB (638 words) - 09:04, 6 January 2018
- ....cs.umd.edu/~amchilds/qa/qa.pdf Andrew M. Childs. Lecture Notes on Quantum Algorithms.] * Lecture 6&7: BV Algorithms, Simon’s Algorithm & Fourier Transform ([http://1.15.137.158/qc2021spring/l ...4 KB (379 words) - 12:06, 27 September 2021
- ...lation formulas nevertheless continue to be used as part of the software [[algorithms]] for solving [[differential equations]]. ...3 KB (411 words) - 18:21, 12 March 2013
- <br>Randomized Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...9 KB (893 words) - 12:43, 15 September 2017
- <br>Randomized Algorithms</font> |image = [[File:MR-randomized-algorithms.png|border|100px]] ...12 KB (1,037 words) - 12:45, 15 September 2017
- <br>Randomized Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...9 KB (846 words) - 07:34, 2 June 2014
- <br>Advanced Algorithms</font> |data16 = [[File:MR-randomized-algorithms.png|border|100px]] ...13 KB (1,427 words) - 15:57, 9 January 2024
- <br>Randomized Algorithms</font> |data10 = [[File:MR-randomized-algorithms.png|border|100px]] ...10 KB (1,029 words) - 12:44, 15 September 2017
- [[Category:Algorithms]] ...1 KB (183 words) - 22:13, 8 March 2013
- Last time we talked about algorithms. Today's topic is '''complexity'''. ; Complexity of algorithms ...25 KB (4,263 words) - 08:43, 7 June 2010
- ...niform spanning trees by Wilson. Among other applications, we discover new algorithms to sample satisfying assignments of <math>k</math>-CNF formulas with bounde ...me approximation algorithms for general graphs into random order streaming algorithms. We illustrate our technique by showing that in random order streams, one c ...7 KB (999 words) - 05:35, 13 July 2017
- The unsolved problem [[P versus NP|P = NP]] asks whether polynomial time algorithms actually exist for NP-complete, and by corollary, all NP problems. It is wi ...1 KB (208 words) - 12:39, 30 December 2016
- ....cs.umd.edu/~amchilds/qa/qa.pdf Andrew M. Childs. Lecture Notes on Quantum Algorithms.] ...2 KB (222 words) - 06:09, 21 February 2022
- == Approximation Algorithms == ;Approximation algorithms ...20 KB (3,484 words) - 05:14, 11 June 2010
- ...oreover, this randomized algorithm plays against adaptive adversaries. Our algorithms are the first to break the <math>O(mn)</math> bound with adaptive adversari ...supervised by Professor Hanpin Wang. His research focuses on approximation algorithms for counting and sampling problems. Typical problems include computing marg ...16 KB (900 words) - 04:52, 13 November 2020
- ...oreover, this randomized algorithm plays against adaptive adversaries. Our algorithms are the first to break the <math>O(mn)</math> bound with adaptive adversari ...supervised by Professor Hanpin Wang. His research focuses on approximation algorithms for counting and sampling problems. Typical problems include computing marg ...16 KB (900 words) - 04:54, 13 November 2020
- ...ople's incentives can affect the learning problems, and to design reliable algorithms that perform well in these strategic environments. ...discuss two lines of my work that address these challenges: designing fast algorithms that are provably robust for several fundamental problems in machine learni ...12 KB (1,731 words) - 06:09, 29 April 2019
- ....cs.umd.edu/~amchilds/qa/qa.pdf Andrew M. Childs. Lecture Notes on Quantum Algorithms. 30 May 2017] ...2 KB (234 words) - 07:58, 12 September 2019
- ...n.jpeg|border|100px]]||P. J. Cameron. ''Combinatorics: Topics, Techniques, Algorithms.'' Cambridge University Press, 1995. ...2 KB (203 words) - 10:00, 16 August 2011
- ...oreover, this randomized algorithm plays against adaptive adversaries. Our algorithms are the first to break the <math>O(mn)</math> bound with adaptive adversari ...supervised by Professor Hanpin Wang. His research focuses on approximation algorithms for counting and sampling problems. Typical problems include computing marg ...20 KB (1,328 words) - 14:52, 20 November 2020
- This course will study ''Randomized Algorithms'', the algorithms that use randomness in computation. * Randomized algorithms can be simpler than deterministic ones. ...22 KB (3,591 words) - 03:54, 17 February 2014
- This course will study ''Randomized Algorithms'', the algorithms that use randomness in computation. * Randomized algorithms can be simpler than deterministic ones. ...22 KB (3,591 words) - 10:45, 4 March 2013
- [[Category:Randomised algorithms]] ...2 KB (307 words) - 14:25, 25 June 2017
- ;Oblivious routing algorithms ...ven more oblivious than this standard definition.) Compared to the routing algorithms which are adaptive to the path that the packet traversed, oblivious routing ...12 KB (2,110 words) - 02:55, 19 July 2011
- ...ized algorithms look like. Two basic principles are used to analyze these algorithms: linearity of expectations, and independence of events. ...ant classes of randomized algorithms: Las Vegas algorithms and Monte Carlo algorithms. I will introduce their definitions at the end of this lecture. ...16 KB (2,893 words) - 08:43, 7 June 2010
- : Efficient Algorithms and Data Structures for Geometric Computing [https://www.amazon.com/Distributed-Algorithms-Kaufmann-Management-Systems/dp/1558603484 Book Chapter 6.7], [https://group ...21 KB (2,460 words) - 17:28, 7 March 2023
- ...has been successfully applied in the analysis of many approximate counting algorithms. In this talk, I will demostrate the general idea behind this technique and ...5 KB (714 words) - 04:34, 17 January 2018
- == Distributed algorithms == ...2 KB (343 words) - 09:13, 12 January 2011
- ...]]. Some people like trying to find big primes. Since there are tricks and algorithms to finding Mersenne primes quickly, the largest known primes are also Merse ...3 KB (434 words) - 14:07, 21 July 2017
- :<font size=3>'''Title''': Data Driven Algorithms for Assortment Planning</font> ...ly learn consumers’ model and optimize assortment selection decisions. Our algorithms’ performance guarantees surprisingly do not depend on the number of candida ...14 KB (1,850 words) - 01:51, 7 May 2018
- ...raphs] have found extensive applications in computer science, in designing algorithms, [http://en.wikipedia.org/wiki/Error_correcting_code error correcting codes ...te. Studies of these two problems revolutionized the area of approximation algorithms. ...8 KB (1,407 words) - 02:23, 25 July 2011
- == Algorithms == ...15 KB (3,049 words) - 03:53, 17 August 2011
- ...ction estimation is the most important part of most reinforcement learning algorithms. ...3 KB (519 words) - 01:25, 5 April 2017
- ...i> T.H. Cormen， C.E. Leiserson， R.L. Rivest， and C. Stein. Introduction to Algorithms.] .... A Reliable Randomized Algorithm for the Closest-Pair Problem. Journal of Algorithms， 25(1):19{51， 1997.] ...17 KB (967 words) - 06:08, 9 November 2010
- ...''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis'', by Michael Mitzenmacher, Eli Upfal; Cambridge Universi ...y] and other [https://peteroupc.github.io/bernoulli.html Bernoulli factory algorithms] ...15 KB (1,488 words) - 11:17, 6 May 2024
- :Consider the theorem of large independent set in [[Randomized Algorithms (Spring 2010)/The probabilistic method|Lecture 8]]. The proof of the theore ...3 KB (592 words) - 14:37, 19 April 2010
- ;Oblivious routing algorithms ...ven more oblivious than this standard definition.) Compared to the routing algorithms which are adaptive to the path that the packet traversed, oblivious routing ...17 KB (3,066 words) - 06:06, 18 April 2013
- == Online Algorithms and Competitive Ratio== For online algorithms, a notion similar to the approximation ratio, the '''competitive ratio''' w ...33 KB (5,832 words) - 04:31, 8 November 2021
- We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...33 KB (5,832 words) - 05:22, 29 October 2019
- We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...33 KB (5,832 words) - 03:44, 27 October 2017
- We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...33 KB (5,832 words) - 06:23, 29 September 2016
- == Online Algorithms and Competitive Ratio== For online algorithms, a notion similar to the approximation ratio, the '''competitive ratio''' w ...33 KB (5,832 words) - 15:45, 19 November 2022
- We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...33 KB (5,832 words) - 13:15, 25 October 2020
- We present our algorithms in the original set cover setting (instead of the hitting set version). ...</math> is also the best approximation ratio achievable by polynomial time algorithms, assuming that '''NP'''<math>neq</math>'''P'''. ...33 KB (5,832 words) - 07:54, 31 October 2018
- ...ters of random walks are closely related to the performances of randomized algorithms based on random walks: ...4 KB (699 words) - 15:06, 19 July 2011
- [[Category:Algorithms]] ...4 KB (700 words) - 14:03, 20 September 2015
- ...ly speaking). We need to introduce some general concepts for approximation algorithms. ...>. Apparently, this is a more natural way to relax the FPTAS to randomized algorithms as it mimics the way of generalizing class '''P''' to '''BPP''' for decisio ...23 KB (4,076 words) - 15:50, 12 May 2014
- * Dowling, W. and Gallier, J. (1984), "Linear-time algorithms for testing the satisfiability of propositional Horn formulae". ''[[Journal ...5 KB (707 words) - 11:24, 18 May 2013
- ...The argument uses an important principle for the probabilistic analysis of algorithms: the principle of deferred decisions. ...ortant idea called '''random walks'''. There is a huge class of randomized algorithms for random sampling based on this principle. ...29 KB (4,994 words) - 01:21, 29 August 2011
- ...''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis'', by Michael Mitzenmacher, Eli Upfal; Cambridge Universi ...y] and other [https://peteroupc.github.io/bernoulli.html Bernoulli factory algorithms] ...21 KB (2,167 words) - 07:44, 27 February 2024
- ;Oblivious routing algorithms ...ven more oblivious than this standard definition.) Compared to the routing algorithms which are adaptive to the path that the packet traversed, oblivious routing ...27 KB (4,865 words) - 07:47, 24 March 2014
- ;Oblivious routing algorithms ...ven more oblivious than this standard definition.) Compared to the routing algorithms which are adaptive to the path that the packet traversed, oblivious routing ...27 KB (4,865 words) - 08:14, 24 March 2014
- ...ions <math>f:\{0,1\}^*\rightarrow\mathbb{N}</math> computable by poly-time algorithms. The classes '''FP''' and '''#P''' are the analogs of '''P''' and '''NP''' For deterministic algorithms, there are negative news for this problem. ...37 KB (6,579 words) - 08:26, 7 June 2010
- ...nd for the number of rounds required in the worst case by such distributed algorithms. This suggests us to define such a computational model for local distributed algorithms: any <math>t</math>-round local algorithm is described by a function ...25 KB (4,530 words) - 12:14, 26 May 2023
- ...s a very simple scheme for boosting the accuracy of Monte Carlo randomized algorithms with two-sided errors. ...5 KB (842 words) - 01:10, 30 March 2010
- ...raphs] have found extensive applications in computer science, in designing algorithms, [http://en.wikipedia.org/wiki/Error_correcting_code error correcting codes ...te. Studies of these two problems revolutionized the area of approximation algorithms. ...15 KB (2,745 words) - 10:19, 4 January 2011
- ...ps://people.csail.mit.edu/jsolomon/share/book/numerical_book.pdf Numerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics. Justin Solom ...8 KB (752 words) - 08:34, 6 March 2024
- ...ps://people.csail.mit.edu/jsolomon/share/book/numerical_book.pdf Numerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics. Justin Solom ...6 KB (657 words) - 01:36, 2 May 2024
- The Feistel construction is also used in cryptographic algorithms other than block ciphers. For example, the [[Optimal Asymmetric Encryption ...5 KB (757 words) - 08:22, 4 April 2017
- ;Oblivious routing algorithms ...ven more oblivious than this standard definition.) Compared to the routing algorithms which are adaptive to the path that the packet traversed, oblivious routing ...31 KB (5,481 words) - 03:52, 9 November 2010
- ...is a structure shared by a class of optimization problems for which greedy algorithms work. ...7 KB (1,266 words) - 13:23, 11 December 2011
- We will show that on any instance of the Max-SAT, one of the two algorithms is a <math>\frac{3}{4}</math>-approximation algorithm. ...8 KB (1,443 words) - 14:02, 6 November 2011
- We will show that on any instance of the Max-SAT, one of the two algorithms is a <math>\frac{3}{4}</math>-approximation algorithm. ...8 KB (1,443 words) - 05:44, 13 November 2015
- The answer depends what exactly we mean by "polynomial-time" algorithms. Rigorously, an algorithm is '''polynomial-time''' if its worst-case runni However, much faster and simpler randomized primality testing algorithms were known long before the discovery of efficient deterministic primality t ...21 KB (3,794 words) - 09:47, 10 September 2015
- ...he dimensionality reduced data. In many cases, this approach will speed up algorithms for solving <math>k</math>-means clustering. ...7 KB (1,336 words) - 07:57, 20 December 2021