Gram-matrix overlap turns inlier identification into a structured recovery problem, enabling exact recovery with as few as order sqrt(n) inliers when dimension matches sample size.
Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3–4):457–466, 1998
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Inlier Recovery for Robust Registration via Gram-Matrix Overlap
Gram-matrix overlap turns inlier identification into a structured recovery problem, enabling exact recovery with as few as order sqrt(n) inliers when dimension matches sample size.