Courses from 1000+ universities
$7.2 billion in combined revenue since 2020. $8 billion in lost market value. This merger marks the end of an era in online education.
600 Free Google Certifications
Management & Leadership
Cybersecurity
Digital Marketing
Learn Like a Pro: Science-Based Tools to Become Better at Anything
Uncommon Sense Teaching
Programming for Everybody (Getting Started with Python)
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explores non-asymptotic analysis of l1 support vector machines for sparse classification in high-dimensional data, providing error guarantees applicable to real-world scenarios.
Explore advanced stochastic optimization techniques for large-scale machine learning, including novel Newton-based algorithms and hybrid approaches that achieve improved convergence rates and efficiency.
Explore advanced concepts in Compressive Sensing, including reconstruction algorithms, matrix coherence, and random measurements, building on foundational theory for efficient high-dimensional data acquisition.
Explores counterintuitive effects of privacy in targeted advertising, revealing how increased privacy can paradoxically lead to more information disclosure and unexpected economic outcomes.
Explore polyhedral relaxations in combinatorial optimization through volume calculations, examining fixed-charge problems and trilinear monomials for practical spatial branch-and-bound implementation guidance.
Overview of lower bound results for the Lasserre hierarchy, including characterization of hardest problems, integrality gap for scheduling, and analysis of symmetric formulations using polynomial inequalities.
Explore graph invariants and their connections to invariant theory in this insightful lecture by renowned mathematician Alexander Schrijver.
Explore new geometric applications of quantum field theory in this insightful talk by Andrew Neitzke, highlighting recent trends and challenges in mathematical sciences.
Explore combinatorial optimization with Michel Goemans in this insightful lecture, covering new trends, results, and challenges in mathematical sciences.
Innovative postdoctoral program in mathematics offering advanced studies and research opportunities at the Hausdorff Center, presented by coordinator Karl-Theodor Sturm.
Explore discrete convexity concepts, including L-convex and M-convex functions, their properties, and related notions in combinatorial optimization and discrete mathematics.
Explores supermodular covering theorem's applications in non-TDI graph optimization, including degree-constrained problems, connectivity augmentation, and extensions of disjoint arborescences theorem.
Explores combinatorial polynomial algorithms for skew-bisubmodular function minimization, extending previous work on bisubmodular functions and introducing new concepts in graph theory and optimization.
Explores linear matroid matching in the oracle model, replacing linear algebraic computation with repeated oracle-calls along alternating paths to solve challenging problems in connectivity, rigidity, and count matroids.
Explore efficient algorithms for directed and node-weighted multiway cut problems, focusing on simple rounding techniques and integrality gap analysis in graph theory and combinatorial optimization.
Get personalized course recommendations, track subjects and courses with reminders, and more.