Randomized Sketching
Randomized Sketching is a probabilistic dimensionality reduction technique in streaming algorithms that compactly summarizes high-dimensional data streams into a low-dimensional randomized sketch, preserving key structural properties with high probability while using limited memory and computational resources.
37
Publications
2.4K
Citations
93
Authors
49
Institutions
Publications per year
2017–2026
10
Parents
37
Fast and scalable polynomial kernels via explicit feature maps
Ninh Pham, Rasmus Pagh · 2013 · 326 citations
1–5 of 37
93
5
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 93
49
University of California, Berkeley
Berkeley, United States
4 h-index
6 publications
362 citations
IBM Research - Almaden
San Jose, United States
4 h-index
4 publications
237 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
7 publications
265 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
8 publications
461 citations

Indian Institute of Technology Kanpur
Kanpur, India
2 h-index
2 publications
27 citations
IIT@MIT
Cambridge, United States
2 h-index
2 publications
486 citations
Princeton University
Princeton, United States
2 h-index
2 publications
176 citations
IBM (United States)
Armonk, United States
2 h-index
3 publications
94 citations
1–8 of 49
Repository · 8 publications · 238 citations
8
h-index
Conference · 2 publications · 24 citations
2
h-index
Repository · 1 publications · 16 citations
1
h-index
1 publications · 43 citations
1
h-index
JMLR · 1 publications · 30 citations
1
h-index
1–5