- Low degree motivic Donaldson-Thomas invariants of the three-dimensional projective space
2023/12/15 by Anna M. Viergever, Viergever, Anna M. · 1 citation
Mathematics · #14F42 #14N35 #Advanced Combinatorial Mathematics #Algebra over a field #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Algebraic structures and combinatorial models #Cohomology #Combinatorics #Computer science #Conjecture #De Rham cohomology #Degree (music) #Equivariant cohomology #FOS: Mathematics #Mathematics #Motivic cohomology #Physics #Projective space #Projective test #Pure mathematics #Space (punctuation) #Tilde
- Negative-Weight Single-Source Shortest Paths in Near-linear Time
2022/03/07 by Aaron Bernstein, Danupon Nanongkai, Bernstein, Aaron +4 · 2 voices · 20 citations
Computer Science · Mathematics · #Algorithm #Algorithms and Data Compression #Binary logarithm #Combinatorial algorithms #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Discrete mathematics #Graph #Mathematics #Planar graph #Randomized algorithm #Running time #Simple (philosophy) #Tilde #Time complexity
- Locally Differentially Private (Contextual) Bandits Learning
2020/06/01 by Kai Zheng, Tianle Cai, Zheng, Kai +7 · 7 citations
Computer Science · Decision Sciences · Mathematics · #Advanced Bandit Algorithms Research #Artificial intelligence #Black box #Combinatorics #Computer science #Context (archaeology) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms #Machine learning #Mathematical optimization #Mathematics #Omega #Point (geometry) #Regret #Regular polygon #Simple (philosophy) #Stochastic Gradient Optimization Techniques #Tilde
- Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
2019/10/31 by Sebastian Förster, Sebastian Forster, Forster, Sebastian +9 · 2 citations
Computer Science · Mathematics · #Algorithm #Approximation algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Directed graph #Discrete mathematics #FOS: Computer and information sciences #Graph #Mathematics #Optimization and Search Problems #Privacy-Preserving Technologies in Data #Randomized algorithm #Running time #Tilde #Time complexity #Undirected graph #Upper and lower bounds #Vertex (graph theory) #cs.DS
- Fast Partial Distance Estimation and Applications
2014/12/26 by Christoph Lenzen, Lenzen, Christoph, Boaz Patt-Shamir +1 · 1 citation
Computer Science · Mathematics · #Approximation algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Distributed #FOS: Computer and information sciences #Integer (computer science) #Mathematics #Optimization and Search Problems #Parallel #Privacy-Preserving Technologies in Data #Randomized algorithm #Tilde #and Cluster Computing (cs.DC) #cs.DC