The following pages link to (Q5461825):
Displayed 50 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Solving molecular distance geometry problems by global optimization algorithms (Q842778) (← links)
- Sensor network localization with imprecise distances (Q875138) (← links)
- Compensated convexity and its applications (Q935274) (← links)
- Rigid versus unique determination of protein structures with geometric buildup (Q941022) (← links)
- On the nonnegative rank of Euclidean distance matrices (Q977487) (← links)
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem (Q1029680) (← links)
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (Q1048270) (← links)
- Computational experience with an algorithm for tetrangle inequality bound smoothing (Q1111968) (← links)
- Some examples of the use of distances as coordinates for euclidean geometry (Q1176392) (← links)
- The embedding problem for predistance matrices (Q1176717) (← links)
- A genetic algorithm for circulant Euclidean distance matrices (Q1294348) (← links)
- Distance matrices and regular figures (Q1316171) (← links)
- An optimization problem on subsets of the symmetric positive-semidefinite matrices (Q1321430) (← links)
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space (Q1346132) (← links)
- Problems of distance geometry and convex properties of quadratic maps (Q1346137) (← links)
- Metric graphs elastically embeddable in the plane (Q1352120) (← links)
- Estimating polypeptide \(\alpha\)-carbon distances from multiple sequence alignments (Q1360623) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Solving the multiple instance problem with axis-parallel rectangles. (Q1399120) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Distance geometry algorithms in molecular modelling of polymer and composite systems. (Q1416411) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- Connected rigidity matroids and unique realizations of graphs (Q1775892) (← links)
- How to describe or design a polyhedron (Q1842764) (← links)
- Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
- Circum-Euclidean distance matrices and faces (Q1906789) (← links)
- Straightening Euclidean invariants (Q1924744) (← links)
- Mechanical theorem proving in projective geometry (Q1924746) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
- An improved hybrid global optimization method for protein tertiary structure prediction (Q2379695) (← links)
- Characterizing graphs with convex and connected Cayley configuration spaces (Q2380778) (← links)
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data (Q2385507) (← links)
- On the dual rigidity matrix (Q2469523) (← links)
- Tolerances in geometric constraint problems (Q2484080) (← links)
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices (Q2494668) (← links)
- Polyspherical coordinate systems on orbit spaces with applications to biomolecular shape (Q2498379) (← links)
- Geometric modeling applications in rational drug design: a survey (Q2506960) (← links)
- Searching for spreads and packings (Q2573120) (← links)
- The cone of distance matrices (Q2639130) (← links)
- A remark on global positioning from local distances (Q3075549) (← links)
- ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID (Q3422213) (← links)
- SOLVING SPATIAL CONSTRAINTS WITH GLOBAL DISTANCE COORDINATE SYSTEM (Q3422220) (← links)
- NON-CARTESIAN MODELLING FOR ANALYSIS OF THE CONSISTENCY OF A GEOMETRIC SPECIFICATION FOR CONCEPTUAL DESIGN (Q3422223) (← links)
- Robust procedures for converting among Lindblad, Kraus and matrix representations of quantum dynamical semigroups (Q4832897) (← links)
- Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method (Q5453487) (← links)
- A systematic framework for solving geometric constraints analytically (Q5926297) (← links)
- On rigidity and realizability of weighted graphs (Q5932187) (← links)
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) (← links)