Search results for free

Institut des Hautes Etudes Scientifiques (IHES)

Free Wreath Products as Fundamental Graph C*-algebras

Explore free wreath products of compact quantum groups, their operator algebras, and properties through graph C*-algebra constructions.

• YouTube
• 44 minutes
• On-Demand
• Free Video

Institut des Hautes Etudes Scientifiques (IHES)

Canonical Grothendieck Polynomials with Free Fermions

Explore canonical Grothendieck polynomials using free fermions, generalizing Schur functions and deriving identities through matrix elements and Wick's theorem.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

Institut des Hautes Etudes Scientifiques (IHES)

Quantum Exclusion Process, Random Matrices and Free Cumulants

Explore quantum exclusion process, random matrices, and free cumulants in relation to particle hopping models and their invariant measure fluctuations.

• YouTube
• 1 hour 5 minutes
• On-Demand
• Free Video

Schmid College, Chapman University

Bianalytic Mappings Between Free Spectrahedra - Semi-Plenary

Explore bianalytic mappings between free spectrahedra, focusing on LMIs, optimization problems, and their applications in systems engineering and quantum information theory.

• YouTube
• 51 minutes
• On-Demand
• Free Video

Institut des Hautes Etudes Scientifiques (IHES)

Demi-Shuffle Duals of Magnus Polynomials in a Free Associative Algebra

Explore linear bases in free associative algebra: Magnus polynomials and their demi-shuffle duals. Discover applications to group-like series coefficients using Le-Murakami, Furusho type formulas.

• YouTube
• 38 minutes
• On-Demand
• Free Video

Insights into Mathematics

Free Abelian Groups and Non-Commutative Groups - Algebraic Topology Review 4

Explore free abelian groups and their role in algebraic topology. Learn about the Fundamental Theorem of Finitely Generated Commutative Groups and non-commutative groups, including cosets and normal subgroups.

• YouTube
• 51 minutes
• On-Demand
• Free Video

Simons Institute

The Approximate Structure of Triangle-Free Graphs

Explore the structure of dense triangle-free graphs and learn about efficient algorithms for computing their approximate representations using smaller graphs.

• YouTube
• 35 minutes
• On-Demand
• Free Video

Center for Language & Speech Processing(CLSP), JHU

Language Modeling and Context-Free Grammars

Explore language modeling and context-free grammars with Ryan Cotterell in this JSALT 2023 lecture, delving into advanced concepts in computational linguistics.

• YouTube
• 1 hour 16 minutes
• On-Demand
• Free Video

Center for Language & Speech Processing(CLSP), JHU

Weak and Strong Learning of Context-Free Grammars - 2012

Explore recent advancements in unsupervised learning of context-free grammars and the transition from weak to strong learning algorithms for accurate syntactic structure prediction.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

The Organic Chemistry Tutor

Force Formulas - Static Friction, Kinetic Friction, Normal Force, Tension Force, and Free Body Diagrams

Master force formulas and free body diagrams for static friction, kinetic friction, normal force, and tension force. Gain essential physics skills through practical examples and comprehensive explanations.

• YouTube
• 20 minutes
• On-Demand
• Free Video

Linux Plumbers Conference

Madvise Lazy Free - Memory Management Optimization Technique

Explore memory management optimization techniques for Linux systems, focusing on the madvise lazy free mechanism and its impact on performance.

• YouTube
• 15 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Mat2Stencil: A Modular Matrix-Based DSL for Explicit and Implicit Matrix-Free PDE Solvers on Structured Grid

Explore Mat2Stencil, a novel domain-specific language for PDE solvers on structured grids. Learn about its matrix abstraction, compiler, and automatic parallelization techniques for efficient implementation.

• YouTube
• 15 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Wait-Free Weak Reference Counting - ISMM 2023

Explore a wait-free algorithm for weak reference counting, improving performance in high-contention scenarios. Learn about implementation, correctness proofs, and performance benchmarks for memory management optimization.

• YouTube
• 16 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Recursive State Machine Guided Graph Folding for Context-Free Language Reachability

Explore an innovative approach to improve CFL-reachability scalability through graph folding, reducing input size and enhancing performance in program analysis applications like alias and value-flow analysis.

• YouTube
• 15 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Designing Wait-free Weak Reference Counting

Explore wait-free weak reference counting design techniques for efficient memory management in concurrent systems.

• YouTube
• 19 minutes
• On-Demand
• Free Video