Search result for Network algorithms Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 165 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
High Performance Computing
by Rich Vuduc , Catherine Gamboa- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 4 months
lesson 1 Work-Span or Dynamic Multithreading Model Intro to the basic algorithmic model Intro to OpenMP a practical programming model Comparison-based sorting algorithms Scans and linked list algorithms Tree algorithms Graph algorithms e....
Free
Algorithm Design and Analysis
by Sampath Kannan- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
You will learn about algorithms that operate on common data structures, for instance sorting and searching; advanced design and analysis techniques such as dynamic programming and greedy algorithms; advanced graph algorithms such as minimum spanning trees and shortest paths; NP-completeness theory; and approximation algorithms. How to analyze the efficiency of algorithms...
$149
Learning Data Structures and Algorithms
by Infinite Skills- 0.0
-
![]()
![]()
![]()
![]()
![]()
8 hours on-demand video
In this Learning Data Structures and Algorithms training course, expert author Rod Stephens will teach you how to analyze and implement common algorithms used. Finally, you will cover trees, balanced trees, decision trees, and network algorithms....
$12.99
Intro to Algorithms
by Michael Littman- 0.0
-
![]()
![]()
![]()
![]()
![]()
Timeline Approx. 4 Months
lesson 1 A Social Network Magic Trick Become familiar with algorithm analysis. lesson 6 Hardness of Network Problems Explore what it means for a social network problem to be "harder" than other. Interview with Tina Eliassi-Rad (Professor, Rutgers University) on statistical measures in network and social networks in security and protests....
Free
Mining Massive Datasets
by Jeffrey D. Ullman , Jure Leskovec , Anand Rajaraman- 0.0
-
![]()
![]()
![]()
![]()
![]()
7 Weeks
The major topics covered include: MapReduce systems and algorithms, Locality-sensitive hashing, Algorithms for data streams, PageRank and Web-link analysis, Frequent itemset analysis, Clustering, Computational advertising, Recommendation systems, Social-network graphs, Dimensionality reduction, and Machine-learning algorithms. MapReduce systems and algorithms Algorithms for data streams Machine-learning algorithms...
$149
Learn Blockchain By Building Your Own In JavaScript
by Eric Traub- 4.7
-
![]()
![]()
![]()
![]()
![]()
8 hours on-demand video
Code out your very own Blockchain and decentralized network in the JavaScript programming language. In this course you will be building your very own blockchain and decentralized blockchain network by using the JavaScript programming language. Hashing algorithms to secure the data within the blockchain. A consensus algorithms to verify that the network nodes have valid data and are synchronized....
$15.99
Graph Algorithms
by Daniel Kane , Alexander S. Kulikov , Michael Levin- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Learn how to use algorithms to explore graphs, compute shortest distance, min spanning tree, and connected components. If you have ever used a navigation service to find the optimal route and estimate time to destination, you've used algorithms on graphs. Minimum spanning tree algorithms...
$150
Related searches
IT Security: Defense against the digital dark arts
by Google Career CertificatesTop Instructor- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 30 hours to complete
We’ll give you some background of encryption algorithms and how they’re used to safeguard data. We’ll also cover network security solutions, ranging from firewalls to Wifi encryption options. Network Attacks Supplemental Reading for Network Attacks Network Attacks Symmetric Encryption Algorithms Asymmetric Encryption Algorithms Hashing Algorithms Hashing Algorithms (continued) Secure Network Architecture Network Monitoring...
Algorithms on Graphs
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 55 hours to complete
If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. We will then talk about shortest paths algorithms — from the basic ones to those which open door for 1000000 times faster algorithms used in Google Maps and other navigational services....
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
How well can you cluster nodes so as to cheaply separate a network into components around a few centers? 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....
