Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Closest Point Search"”.

  1. Considerations on computational lattice problems

    … are the shortest vector problem (SVP), the closest vector problem (CVP) and their approximate versions respectively. All known algorithms that solve these problems exactly run in exponential time, while there are polynomial-time algorithms that solve these problems approximately. The latter …

    zurich

  2. Multi-type nearest and reverse nearest neighbor search : concepts and algorithms.

    … that expand the scope of traditional database search methods for answering location-based queries in today's computing environment. Traditionally, location-based services and other applications have relied heavily on two concepts: the nearest neighbor search (known also as the proximity, …

    umn Repository record for Multi-type nearest and reverse nearest neighbor search : concepts and algorithms. (opens in a new tab)

  3. Applications of Lattices over Wireless Channels

    In wireless networks, reliable communication is a challenging issue due to many attenuation factors such as receiver noise, channel fading, interference and asynchronous delays. Lattice coding and decoding provide efficient solutions to many problems in wireless communications and multiuser …

    waterloo Repository record for Applications of Lattices over Wireless Channels (opens in a new tab)