Search result for Randomized algorithms Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 15 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Guiding Principles for Analysis of Algorithms Randomized Selection - Algorithm Randomized Selection - Analysis...
Approximation Algorithms Part II
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
Upon completion, you will be able to recognize, when faced with a new combinatorial optimization problem, whether it is close to one of a few known basic problems, and will be able to design linear programming relaxations and use randomized rounding to attempt to solve your own problem. Primal-dual algorithms Steiner Forest and Primal-Dual Approximation Algorithms...
Geometric Algorithms
by Kevin Buchin- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
This course deals with the algorithmic aspects of these tasks: we study techniques and concepts needed for the design and analysis of geometric algorithms and data structures. - O-notation, Ω-notation, Θ-notation; how to analyze algorithms Computational Geometry: Algorithms and Applications (3rd edition). Plane Sweep Algorithms Data Structures for Plane Sweep Algorithms...
Algorithms: Design and Analysis, Part 1
by Tim Roughgarden- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Specific topics in the course include: "Big-oh" notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), randomized algorithms (QuickSort, contraction algorithm for min cuts), data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of BFS and DFS, connectivity, shortest paths). Randomized algorithms (QuickSort, contraction algorithm for min cuts)...
$149
Introduction to Probability
by Joseph Blitzstein- 0.0
-
![]()
![]()
![]()
![]()
![]()
10 Weeks
With examples ranging from medical testing to sports prediction, you will gain a strong foundation for the study of statistical inference, stochastic processes, randomized algorithms, and other subjects where probability is needed....
$139
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
This course assumes knowledge of a standard undergraduate Algorithms course, and particularly emphasizes algorithms that can be designed using linear programming, a favorite and amazingly successful technique in this area. Set Cover and Randomized Rounding Lecture: randomized rounding Multiway Cut and Randomized Rounding Lecture: randomized rounding...
Machine Learning
by Charles Isbell- 0.0
-
![]()
![]()
![]()
![]()
![]()
14 Weeks
In this course, we will present algorithms and approaches in such a way that grounds them in larger systems as you learn about a variety of topics, including: randomized search algorithms...
$99
Related searches
Introduction to Genomic Data Science
by Pavel Pevzner , Phillip Compeau- 0.0
-
![]()
![]()
![]()
![]()
![]()
You will learn how to answer this question for many bacteria using straightforward algorithms to look for hidden messages in the genome. Perhaps surprisingly, we will apply randomized algorithms to solve problems. Develop algorithms for solving computational problems Evaluate the effectiveness of algorithms...
$49
Machine Learning: Unsupervised Learning
by Charles Isbell , Michael Littman , Pushkar Kolhe- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 1 months
You will learn about and practice a variety of Unsupervised Learning approaches, including: randomized optimization, clustering, feature selection and transformation, and information theory....
Free
Finding Hidden Messages in DNA (Bioinformatics I)
by Pavel Pevzner , Phillip Compeau- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 16 hours to complete
We will see that we can answer this question for many bacteria using only some straightforward algorithms to look for hidden messages in the genome. Perhaps surprisingly, we will apply randomized algorithms, which roll dice and flip coins in order to solve problems....
