Pages that link to "Item:Q5408231"
From MaRDI portal
The following pages link to Euclidean Distance Geometry and Applications (Q5408231):
Displayed 50 items.
- The unassigned distance geometry problem (Q266818) (← links)
- A Lipschitzian error bound for convex quadratic symmetric cone programming (Q312538) (← links)
- An algorithm for realizing Euclidean distance matrices (Q324865) (← links)
- Unique low rank completability of partially filled matrices (Q326825) (← links)
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
- Discretization orders for protein side chains (Q486406) (← links)
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- Discretization vertex orders in distance geometry (Q499358) (← links)
- Fisher information distance: a geometrical reading (Q499362) (← links)
- Inapproximability results related to monophonic convexity (Q499364) (← links)
- A new measure for comparing biomedical regions of interest in segmentation of digital images (Q499376) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- New methods for the distance geometry problem (Q510922) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- The algebro-geometric study of range maps (Q525495) (← links)
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis (Q778422) (← links)
- Clifford algebra and the discretizable molecular distance geometry problem (Q888986) (← links)
- A symmetry-based splitting strategy for discretizable distance geometry problems (Q1668793) (← links)
- Recent advances on the interval distance geometry problem (Q1683318) (← links)
- Realizing Euclidean distance matrices by sphere intersection (Q1728090) (← links)
- Minimal NMR distance information for rigidity of protein graphs (Q1728101) (← links)
- On the embedding of cone graphs in the line with distinct distances between neighbors (Q1728106) (← links)
- Oriented conformal geometric algebra and the molecular distance geometry problem (Q1728194) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- Preface: Special issue dedicated to distance geometry (Q1756744) (← links)
- A new algorithm for the small-field astrometric point-pattern matching problem (Q1756752) (← links)
- Tuning interval branch-and-prune for protein structure determination (Q1756761) (← links)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix (Q1993487) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- Distance matrices of subsets of the Hamming cube (Q2020430) (← links)
- Graph reconstruction from unlabeled edge lengths (Q2039322) (← links)
- A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← links)
- A cycle-based formulation for the distance geometry problem (Q2056892) (← links)
- Sequence graphs: characterization and counting of admissible elements (Q2056908) (← links)
- The median triangle theorem as an entrance to certain issues in higher-dimensional geometry (Q2088182) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- A quantum approach to the discretizable molecular distance geometry problem (Q2101499) (← links)
- A note on the Cayley-Menger determinant and the molecular distance geometry problem (Q2127101) (← links)
- Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
- Unassigned distance geometry and molecular conformation problems (Q2131140) (← links)
- When a system of real quadratic equations has a solution (Q2143674) (← links)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- Recent advances of stretched Gaussian distribution underlying Hausdorff fractal distance and its applications in fitting stretched Gaussian noise (Q2164836) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- TbGAL: a tensor-based library for geometric algebra (Q2173657) (← links)
- Preface: Special issue on distances in optimization and graphs dedicated to the memory of Michel Deza (Q2174868) (← links)
- A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)