42 research outputs found

    Dimension Reduction Techniques for l_p (1<p<2), with Applications

    Get PDF
    For Euclidean space (l_2), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss [Conf. in modern analysis and probability, AMS 1984], with a host of known applications. Here, we consider the problem of dimension reduction for all l_p spaces 1<p<2. Although strong lower bounds are known for dimension reduction in l_1, Ostrovsky and Rabani [JACM 2002] successfully circumvented these by presenting an l_1 embedding that maintains fidelity in only a bounded distance range, with applications to clustering and nearest neighbor search. However, their embedding techniques are specific to l_1 and do not naturally extend to other norms. In this paper, we apply a range of advanced techniques and produce bounded range dimension reduction embeddings for all of 1<p<2, thereby demonstrating that the approach initiated by Ostrovsky and Rabani for l_1 can be extended to a much more general framework. We also obtain improved bounds in terms of the intrinsic dimensionality. As a result we achieve improved bounds for proximity problems including snowflake embeddings and clustering

    The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

    Full text link
    The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension. The celebrated results of Arora (A-98) and Mitchell (M-99) prove that the above result holds in the special case of TSP in a fixed-dimensional Euclidean space. Thus, our algorithm demonstrates that the algorithmic tractability of metric TSP depends on the dimensionality of the space and not on its specific geometry. This result resolves a problem that has been open since the quasi-polynomial time algorithm of Talwar (T-04)

    Controlling waves in space and time for imaging and focusing in complex media

    Get PDF
    In complex media such as white paint and biological tissue, light encounters nanoscale refractive-index inhomogeneities that cause multiple scattering. Such scattering is usually seen as an impediment to focusing and imaging. However, scientists have recently used strongly scattering materials to focus, shape and compress waves by controlling the many degrees of freedom in the incident waves. This was first demonstrated in the acoustic and microwave domains using time reversal, and is now being performed in the optical realm using spatial light modulators to address the many thousands of spatial degrees of freedom of light. This approach is being used to investigate phenomena such as optical super-resolution and the time reversal of light, thus opening many new avenues for imaging and focusing in turbid medi

    Classification of Aneurysms of the Great Vein of Galen

    No full text
    corecore