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 uwaterloo.ca> |
| 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: Datasmith_1.0-1.zip, r-release: Datasmith_1.0-1.zip, r-oldrel: Datasmith_1.0-1.zip |
| 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 https://CRAN.R-project.org/package=Datasmith to link to this page.