307 search results - page 2 / 62 » Low-Distortion Embeddings of Trees |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
ITIIS
2010
2010
Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting
13 years 4 months ago
To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embed...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...
COMBINATORICA
2010
13 years 2 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...