Search results

Jump to navigation Jump to search
View ( | ) (20 | 50 | 100 | 250 | 500)
  • ...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) - 10:45, 4 March 2013
  • 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
  • [[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
  • 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
  • == 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
  • ...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
  • 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
  • ...ps://people.csail.mit.edu/jsolomon/share/book/numerical_book.pdf Numerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics. Justin Solom ...
    7 KB (681 words) - 05:31, 15 May 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 ...
    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
View ( | ) (20 | 50 | 100 | 250 | 500)