Solving Jigsaw Puzzles by the Graph Connection Laplacian (Q5143313): Difference between revisions

@@ Property / arXiv ID @@
+.03188
@@ Property / arXiv ID: 1811.03188 / rank @@
+Normal rank
@@ Property / cites work @@
+A Cheeger Inequality for the Graph Connection Laplacian
+Normal rank
@@ Property / cites work @@
+Shotgun assembly of random jigsaw puzzles
@@ Property / cites work: Shotgun assembly of random jigsaw puzzles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+The Rotation of Eigenvectors by a Perturbation. III
+Normal rank
@@ Property / cites work @@
+Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
+Normal rank
@@ Property / cites work @@
+Graph connection Laplacian methods can be made robust to noise
+Normal rank
@@ Property / cites work @@
+An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Vector diffusion maps and the connection Laplacian
+Normal rank
@@ Property / cites work @@
+A useful variant of the Davis–Kahan theorem for statisticians
+Normal rank