15 citations · 28 across the 9 of their papers we have counts for
10 papers
Experimental Investigation of Optical Processing With Spatial Light Modulation
Maria Gabriela Damaceno, Antonio Mucherino, Renné Medeiros de Araújo +2
The growing demand for real-time data processing in applications such as neural networks and embedded control systems has spurred the search for faster, more efficient alternatives…
On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
Mengmeng Song, Douglas Goncalves, Woosuk L. Jung +3
We consider the nonconvex minimization problem, with quartic objective function, that arises in the exact recovery of a configuration matrix of points when a Euc…
An impossible utopia in distance geometry
Germano Abud, Jorge Alencar, Carlile Lavor +2
The Distance Geometry Problem asks for a realization of a given weighted graph in . Two variants of this problem, both originating from protein conformation, are base…
Solving the One-dimensional Distance Geometry Problem by Optical Computing
S. B. Hengeveld, N. Rubiano da Silva, D. S. Gonçalves +2
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformat…
Euclidean distance geometry and applications
Leo Liberti, Carlile Lavor, Nelson Maculan +1
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomple…
Polynomial cases of the Discretizable Molecular Distance Geometry Problem
Leo Liberti, Carlile Lavor, Benoit Masson +1
An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge…