Data Deduplication For Redundant Graph Structures Files
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=ck0LmoY9aV8
Olgica Milenkovic (University of Illinois at Urbana-Champaign)
https://simons.berkeley.edu/talks/olgica-milenkovic-university-illinois-urbana-champaign-2024-03-08
Application-Driven Coding Theory
We investigate the issues of robust and minimum fragmentation for data files captured by sparse graphs. In the process, we establish numerous connections between deduplication and classical combinatorial problems of broad applicability.
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Application-Driven Coding Theory
Olgica Milenkovic