LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES · SUBJECT

Computer Science

388 LECTURES · PAGE 6 OF 17
MathematicsPhysics & AstronomyPolitical ScienceWorld HistoryEconomics & FinanceLawHealth & MedicinePsychology & BehaviorPhilosophy & EthicsEngineeringBusiness & ManagementEducationBiology & Life ScienceEnvironmentSociologyLiteratureChemistryEarth ScienceClassics & Ancient WorldMusicReligionArt & Art HistorySystem TheoryLinguisticsElectrical EngineeringLanguages
Generative AI: Adapting LLMs with Parameter-Efficient Fine-Tuning
Computer Science

Generative AI: Adapting LLMs with Parameter-Efficient Fine-Tuning

MIT · 78 MIN
Generative AI: Text-to-Image Models
Computer Science

Generative AI: Text-to-Image Models

MIT · 76 MIN
How Hard is too Hard? An Introduction to Complexity
Computer Science

How Hard is too Hard? An Introduction to Complexity

GRESHAM COLLEGE · 44 MIN
AI Agent Simulation of Human Behavior
Computer Science

AI Agent Simulation of Human Behavior

STANFORD · 61 MIN
An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC Learning
Computer Science

An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC Learning

IAS · 111 MIN
Gravitational Waveform Modeling with Physics-Informed Neural Networks and Surrogates
Computer Science

Gravitational Waveform Modeling with Physics-Informed Neural Networks and Surrogates

IAS · 63 MIN
Learning from Complexity
Computer Science

Learning from Complexity

IAS · 69 MIN
A Probabilistic Construction of Bipartite Ramanujan Graphs
Computer Science

A Probabilistic Construction of Bipartite Ramanujan Graphs

IAS · 101 MIN
Generative AI: Large Language Models (LLMs) and Retrieval Augmented Generation (RAG)
Computer Science

Generative AI: Large Language Models (LLMs) and Retrieval Augmented Generation (RAG)

MIT · 75 MIN
Lecture 16: Data Compression and Shannon's Noiseless Coding Theorem
Computer Science

Lecture 16: Data Compression and Shannon's Noiseless Coding Theorem

MIT · 69 MIN
A Complexity Lower Bound on Algebra Isomorphisms
Computer Science

A Complexity Lower Bound on Algebra Isomorphisms

IAS · 130 MIN
Reverse Mathematics of Complexity Lower Bounds, Part II
Computer Science

Reverse Mathematics of Complexity Lower Bounds, Part II

IAS · 115 MIN
Lecture 2: Independence and Conditioning
Computer Science

Lecture 2: Independence and Conditioning

MIT · 71 MIN
Fiction and Stories in Games
Computer Science

Fiction and Stories in Games

MIT · 85 MIN
Embodied Intelligence with Morphing Materials and Mechanisms
Computer Science

Embodied Intelligence with Morphing Materials and Mechanisms

STANFORD · 67 MIN
Automorphism in Gauge Theory and Clifford-Hierarchy Stabilizer Codes
Computer Science

Automorphism in Gauge Theory and Clifford-Hierarchy Stabilizer Codes

IAS · 73 MIN
Abstraction and Simulation
Computer Science

Abstraction and Simulation

MIT · 82 MIN
Puzzles
Computer Science

Puzzles

MIT · 75 MIN
Transmitting Information Reliably over a Noisy Channel & Shannon's Noisy Coding Theorem
Computer Science

Transmitting Information Reliably over a Noisy Channel & Shannon's Noisy Coding Theorem

MIT · 72 MIN
AI in Healthcare: Why Hospitals Are Moving Cautiously Toward Consolidation
Computer Science

AI in Healthcare: Why Hospitals Are Moving Cautiously Toward Consolidation

STANFORD · 36 MIN
All-Pairs Min-Cut vs. All-Pairs Shortest-Path
Computer Science

All-Pairs Min-Cut vs. All-Pairs Shortest-Path

IAS · 60 MIN
Deep Learning for Natural Language: Transformers, Self-Supervised Learning
Computer Science

Deep Learning for Natural Language: Transformers, Self-Supervised Learning

MIT · 77 MIN
A More Efficient Sifting Lemma and a Stronger 3-Player Communication Lower Bound
Computer Science

A More Efficient Sifting Lemma and a Stronger 3-Player Communication Lower Bound

IAS · 121 MIN
Frontier Systems: Opening Lecture
Computer Science

Frontier Systems: Opening Lecture

STANFORD · 66 MIN
← PREV PAGE 6 OF 17 NEXT →