Linear Probing
Linear Probing is a collision resolution technique in hash tables that belongs to the class of open-addressing methods, distinguished by its strategy of sequentially searching the next available slot in the table by incrementing the index by one until an empty position is found.
38
Publications
2.7K
Citations
125
Authors
41
Institutions
Publications per year
2017–2026
14
Parents
38
Reproducible Scaling Laws for Contrastive Language-Image Learning
Mehdi Cherti, Romain Beaumont, Ross Wightman et al. · 2023 · 496 citations
Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distribution
Ananya Kumar, Aditi Raghunathan, R. Jones et al. · arXiv (Cornell University) · 2022 · 159 citations · Full text
MaskCLIP: Masked Self-Distillation Advances Contrastive Language-Image Pretraining
Xiaoyi Dong, Jianmin Bao, Yinglin Zheng et al. · 2023 · 147 citations
1–5 of 38
125
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 125
41
University of California, Berkeley
Berkeley, United States
2 h-index
6 publications
641 citations
Berkeley College
New York, United States
2 h-index
6 publications
641 citations
University of Washington
Seattle, United States
2 h-index
4 publications
1.5K citations

Uppsala University
Uppsala, Sweden
2 h-index
2 publications
66 citations

IT University of Copenhagen
Copenhagen, Denmark
2 h-index
5 publications
176 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
102 citations
The University of Texas at Austin
Austin, United States
1 h-index
2 publications
38 citations
The University of Texas at Dallas
Richardson, United States
1 h-index
2 publications
38 citations
1–8 of 41
Repository · 7 publications · 447 citations
7
h-index
TALG · 3 publications · 58 citations
3
h-index
2 publications · 70 citations
2
h-index
Conference · 2 publications · 47 citations
2
h-index
2 publications · 200 citations
2
h-index
1–5