Datasmith: Tools to Complete Euclidean Distance Matrices

Implements several algorithms for Euclidean distance matrix completion, Sensor Network Localization, and sparse Euclidean distance matrix completion using the minimum spanning tree.

Version: 1.0-1
Depends: R (≥ 3.1.0)
Imports: Matrix, igraph, lbfgs, truncnorm, MASS, nloptr, vegan
Published: 2017-01-06
Author: Adam Rahman and Wayne Oldford
Maintainer: Adam Rahman <a45rahma at>
License: GPL-2 | GPL-3
NeedsCompilation: yes
CRAN checks: Datasmith results


Reference manual: Datasmith.pdf
Package source: Datasmith_1.0-1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: Datasmith_1.0-1.tgz
OS X Mavericks binaries: r-oldrel: Datasmith_1.0-1.tgz


Please use the canonical form to link to this page.