25 search results - page 1 / 5 » An Exact Algorithm for Minimum Distortion Embedding |
WG
2009
Springer
13 years 11 months ago
2009
Springer
TCS
2011
12 years 12 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
ICMCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we present a novel data hiding scheme based on the minimum distortion look-up table (LUT) embedding that achieves good distortion-robustness performance. We first ...
IPL
2010
13 years 3 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
ICCAD
1997
IEEE
13 years 9 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...