Login / Signup
Optimal permutation routing for low-dimensional hypercubes.
Ambrose Kofi Laing
David W. Krumme
Published in:
Networks (2010)
Keyphrases
</>
low dimensional
high dimensional
dimensionality reduction
dynamic programming
input space
principal component analysis
manifold learning
data sets
data points
knn
worst case
high dimensional data
ad hoc networks
routing algorithm
routing problem
optimal design