Pages that link to "Item:Q1301705"

The following pages link to On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705):

Displaying 39 items.

• The medians of discrete sets (Q293267) (← links)
• Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
• Discrete tomography determination of bounded lattice sets from four X-rays (Q387864) (← links)
• A reconstruction algorithm for a subclass of instances of the 2-color problem (Q638558) (← links)
• Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
• Adaptive thresholding of tomograms by projection distance minimization (Q834271) (← links)
• Discrete tomography with unknown intensity levels using higher-order statistics (Q892823) (← links)
• On the reconstruction of binary and permutation matrices under (binary) tomographic constraints (Q952460) (← links)
• A note on affinely regular polygons (Q1003588) (← links)
• Generic iterative subset algorithms for discrete tomography (Q1003704) (← links)
• Numerical characterization of \(n\)-cube subset partitioning (Q1026122) (← links)
• Uniqueness in discrete tomography of Delone sets with long-range order (Q1042458) (← links)
• Stability results for uniquely determined sets from two directions in discrete tomography (Q1043557) (← links)
• An algorithm reconstructing convex lattice sets. (Q1401390) (← links)
• On the computational complexity of determining polyatomic structures by X-rays (Q1575953) (← links)
• On the algorithmic inversion of the discrete Radon transform (Q1603700) (← links)
• A short scientific biography of Maurice Nivat (Q1605477) (← links)
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections (Q1606912) (← links)
• Algorithms for linear time reconstruction by discrete tomography (Q2009015) (← links)
• Algorithms for linear time reconstruction by discrete tomography. II (Q2028077) (← links)
• Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
• On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity (Q2197684) (← links)
• Computational complexity of three-dimensional discrete tomography with missing data (Q2231602) (← links)
• Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\) (Q2255815) (← links)
• A rounding theorem for unique binary tomographic reconstruction (Q2274077) (← links)
• A network flow algorithm for reconstructing binary images from discrete X-rays (Q2384105) (← links)
• Half-regular factorizations of the complete bipartite graph (Q2399287) (← links)
• Regular switching components (Q2422036) (← links)
• Hankel and Toeplitz X-rays of permutations (Q2447974) (← links)
• An evolutionary algorithm for discrete tomography (Q2573237) (← links)
• Constructing bounded degree graphs with prescribed degree and neighbor degree sequences (Q2696614) (← links)
• Approximating Bicolored Images from Discrete Projections (Q3003545) (← links)
• The Fewest Clues Problem of Picross 3D (Q3301015) (← links)
• On the X-rays of permutations (Q3439186) (← links)
• A new algorithm for 3D binary tomography (Q3439190) (← links)
• Dynamic discrete tomography (Q4634750) (← links)
• Fast binary CT using Fourier null space regularization (FNSR) (Q5220322) (← links)
• Error Correction for Discrete Tomography (Q6094519) (← links)
• Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms (Q6168341) (← links)