239 search results - page 2 / 48 » Some Results on Greedy Embeddings in Metric Spaces |
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
IJCAI
2007
13 years 6 months ago
2007
Dimensionality reduction is a much-studied task in machine learning in which high-dimensional data is mapped, possibly via a non-linear transformation, onto a low-dimensional mani...
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...