We consider the problem of estimating the locations of a set of points in a k-dimensional euclidean space given a subset of the pairwise distance measurements between the points. We focus on the case when some fraction of these measurements can be arbitrarily corrupted by large additive noise. This is motivated by applications like sensor networks, molecular conformation and manifold learning where the measurement process can induce large bias errors in some fraction of the distance measurements due to physical effects like multipath, spin-diffusion etc. Given the NP-completeness of the problem, we propose a convex relaxation that involves decomposing the partially observed matrix of distance measurements into low-rank and sparse components, wherein the low-rank component corresponds to the Euclidean Distance Matrix and the sparse component is a matrix of biases. Using recent results from the literature, we show that this convex relaxation yields the exact solution for the class of fixed radius random geometric graphs. We evaluate the performance of the algorithm on an experimental data set obtained from a network of 44 nodes in an indoor environment and show that the algorithm is robust to non-line-of-sight bias errors.