YoVDO

Data Deduplication for Redundant Graph Structures Files

Offered By: Simons Institute via YouTube

Tags

Graph Theory Courses Combinatorics Courses Data Management Courses Coding Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the concept of data deduplication for redundant graph structures files in this 53-minute lecture by Olgica Milenkovic from the University of Illinois at Urbana-Champaign. Delve into the investigation of robust and minimum fragmentation issues for data files represented by sparse graphs. Discover the connections between deduplication and classical combinatorial problems with wide-ranging applications. Gain insights into application-driven coding theory and its relevance to data management in graph structures.

Syllabus

Data Deduplication For Redundant Graph Structures Files


Taught by

Simons Institute

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera Analytic Combinatorics, Part II
Princeton University via Coursera Analytic Combinatorics
Princeton University via Coursera Principles of Computing (Part 1)
Rice University via Coursera Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera