deBGR: An Efficient and Near Exact Representation of the Weighted deBruijn Graph

Channel:
United States Google TechTalks
Subscribers:
348,000
Published on ● Video Link: https://www.youtube.com/watch?v=09RVX85Ljhw


Duration: 1:01:11
1,085 views
16

A Google Algorithms TechTalk, 9/26/17, presented by Prashant Pandey, Stony Brook
Talks from visiting speakers on Algorithms, Theory, and Optimization



Other Videos By Google TechTalks


2018-01-22State of golang.org/x/text
2018-01-08Revenue Maximization with an Uncertainty-Averse Buyer
2018-01-08Fast, Deterministic, and Sparse Dimensionality Reduction
2017-12-08Surviving Without Generics
2017-12-08Go In Your Browser
2017-12-05Sidewalks Get Personal: A Pedestrian-Centered Approach for Equitable Urban Wayfinding
2017-11-19Introduction to the Java Memory Model
2017-11-08When the Optimum is also Blind: A New Perspective on Universal Optimization
2017-10-25Deferred-Acceptance Auctions: Worst-Case Approximation Guarantees
2017-10-25The Limit of Rationality in Choice Modeling
2017-10-02deBGR: An Efficient and Near Exact Representation of the Weighted deBruijn Graph
2017-10-02Thompson Sampling for Learning in Online Decision Making
2017-09-26Deep Neural Networks in Medical Imaging and Radiology
2017-09-25Zerocash: Addressing Bitcoin's Privacy Problem
2017-08-31Randomized Online Matching in Regular Graphs
2017-08-29Bernoulli Factories and Blackbox Reductions
2017-08-29Applications of Strongly Rayleigh Measures in Counting and Optimization
2017-05-25Learning from Untrusted Data
2017-05-25Computational Aspects of Optimal Information Revelation
2017-05-25Multi-armed Bandit Problems with Strategic Arms
2017-05-25Hardness of Approximation Between P and NP


Tags:
google techtalk
algorithms