Udacity Self 公开课(进行中)

      字母序 将开始 进行中

Introduction to Hadoop and MapReduce (Udacity) 1 个评论 关注

开始时间: 04/22/2022 持续时间: 自主

主页: https://www.udacity.com/course/ud617

简介: The Apache™ Hadoop® project develops open-source software for reliable, scalable, distributed computing. Learn the fundamental principles behind it, and how you can use its power to make sense of your Big Data.

Artificial Intelligence for Robotics (Udacity) 2 个评论 关注

开始时间: 04/22/2022 持续时间: 自主

主页: https://www.udacity.com/course/cs373

简介: This course will cover probabilistic inference, planning and search, localization, tracking and control, all with a focus on robotics.

Introduction to Parallel Programming (Udacity) 1 个评论 关注

开始时间: 04/22/2022 持续时间: 自主

主页: https://www.udacity.com/course/cs344

简介: You'll master the fundamentals of massively parallel computing by using CUDA C/C++ to program modern GPUs. You'll learn the GPU programming model and architecture, key algorithms and parallel programming patterns, and optimization techniques. Your assignments will illustrate these concepts through image processing applications, but this is a parallel computing course and what you learn will translate to any application domain. Most of all we hope you'll learn how to think in parallel.

Programming Languages (Udacity) 2 个评论 关注

开始时间: 04/22/2022 持续时间: 自主

主页: https://www.udacity.com/course/cs262

简介: This class will give you an introduction to the fundamentals of programming languages. Key concepts include how to specify and process valid strings, sentences and program structures.

Interactive 3D Graphics (Udacity) 0 个评论 关注

开始时间: 04/22/2022 持续时间: 自主

主页: https://www.udacity.com/course/cs291

简介: This class will teach you about the basic principles of 3D computer graphics: meshes, transforms, cameras, materials, lighting, and animation.

Introduction to Theoretical Computer Science (Udacity) 1 个评论 关注

开始时间: 04/22/2022 持续时间: 自主

主页: https://www.udacity.com/course/cs313

简介: This class teaches you about basic concepts in theoretical computer science -- such as NP-completeness -- and what they imply for solving tough algorithmic problems.