curius graph

all pages

showing 81201-81250 of 203142 pages (sorted by popularity)
Fall 2023 Minerva Foundation Lectures
CS W3137, Data Structures and Algorithms, Spring 2014
A new version of the adaptive fast Gauss transform for discrete and continuous sources
Contraction Theory for Dynamical Systems
Krawtchouk polynomials and Krawtchouk matrices
Josef Meixner: his life and his orthogonal polynomials
Ankur Moitra's Homepage
SML group at ETH | teaching
Sociology 250 - Notes on Durkheim
ADAfaEPoV
s8355.pdf
Quantitative Linear Algebra - IPAM
GROTHENDIECK-TYPE INEQUALITIES IN COMBINATORIAL OPTIMIZATION
Alex Postnikov: 18.217 Combinatorial Theory
18.438, Advanced Combinatorial Opt, Fall 2009
Complexity Lower Bounds using Linear Algebra
Symplectic Geometry
General Relativity
Applications of semidefinite programming in complexity theory
Introduction to Optimization: Models and Methods
Lectures on Linear Programming: Foundations and Extensions Graduate level
IE 521 (Convex Optimization) - Fall 2024
bertsimas_linear_cap_1_a_5.pdf
A short course on fast multipole methods
Encyclopedia entry on “Fast Multipole Methods.”
Random bits | Random thoughts about random things…by Jonathan Katz
COMP760: Harmonic Analysis of Boolean funcs
SOME FUNDAMENTAL THEOREMS IN MATHEMATICS OLIVER KNILL
[2409.03077] Backdoor defense, learnability and obfuscation
pdf
KDEformer: Accelerating Transformers via Kernel Density Estimation
[2402.04497] The Fine-Grained Complexity of Gradient Computation for Training Large Language Models
Designing Robust Transformers using Robust Kernel Density Estimation
About | Melon's Puzzles
Approximation Algorithms Lec 13
Daniel Lee - My Digital Reef
CSE 521 Design and Analysis of Algorithms I
CSE 599 Approximate Counting and Mixing Time of Markov chains
CSE 599s Modern Spectral Graph Theory
RazborovMain
TCS+
Notes.pdf
Additive Combinatorics and its Applications in Theoretical Computer Science
Course Policies for CMU 15-859FF: Coping with intractability, Fall 2019
Brian Hu Zhang
CSS.318.1: Coding Theory
Useful Inequalities
Faster Algorithms via Approximation Theory
Open Positions – MPI SWS
Math 167: Proof Complexity