Data Redundancy Reduction
Data Redundancy Reduction is a computational technique in content-addressable storage systems that eliminates duplicate or overlapping data representations by identifying and retaining only unique data segments, thereby optimizing storage efficiency and retrieval accuracy.
846
Publications
40.8K
Citations
2.8K
Authors
924
Institutions
Publications per year
2017–2026
300
Parents
846
Rumor Routing Algorithm For Sensor Networks
David Braginsky, Deborah Estrin · 2002 · 910 citations
Barlow Twins: Self-Supervised Learning via Redundancy Reduction
Jure Žbontar, Jing Li, Ishan Misra et al. · arXiv (Cornell University) · 2021 · 779 citations · Full text
Rumor routing algorthim for sensor networks
David Braginsky, Deborah Estrin · 2002 · 776 citations
1–5 of 846
2.8K
Chinese University of Hong Kong, Hong Kong SAR China
11 publications · 503 citations
11
h-index
8
h-index
6
h-index
6
h-index
5
h-index
1–5 of 2.8K
924
Tsinghua University
Beijing, China
14 h-index
67 publications
1.7K citations
IBM (United States)
Armonk, United States
14 h-index
23 publications
1.8K citations

Huazhong University of Science and Technology
Wuhan, China
13 h-index
50 publications
1.8K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
11 h-index
24 publications
1.5K citations

Chinese Academy of Sciences
Beijing, China
11 h-index
26 publications
751 citations

Shanghai Jiao Tong University
Shanghai, China
10 h-index
38 publications
1.6K citations
University of California San Diego
San Diego, United States
10 h-index
21 publications
610 citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
20 publications
1K citations
1–8 of 924
18 publications · 916 citations
14
h-index
Repository · 15 publications · 1.3K citations
12
h-index
13 publications · 480 citations
12
h-index
TPDS · 15 publications · 312 citations
11
h-index
9 publications · 881 citations
9
h-index
1–5