Concept

Locality-sensitive hashing

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Learning a feasible and stabilizing explicit model predictive control law by robust optimization

Colin Neil Jones, Melanie Nicole Zeilinger

Fast model predictive control on embedded sys- tems has been successfully applied to plants with microsecond sampling times employing a precomputed state-to-input map. However, the complexity of this so-called explicit MPC can be prohibitive even for low-d ...

2011

Distributed Similarity Search in High Dimensions Using Locality Sensitive Hashing

Karl Aberer, Sebastian Michel, Parisa Haghani

In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH) which has proven very efficient in answering KNN queries in centralized set ...

2009

Antenna selection with superposition for 4 x 2 DSTTD systems

Ali H. Sayed

From 1820 4 times 4 binary matrices, 253 binary preprocessing matrices are designed for double space-time transmit diversity (DSTTD) systems with two 2 times 2 space-time block code (STBC) encoders. Among them, six matrices yielding the highest average min ...

IEEE2009

Storing and Indexing Spatial Data in P2P Systems

The peer-to-peer (P2P) paradigm has become very popular for storing and sharing information in a totally decentralized manner. At first, research focused on P2P systems that host 1D data. Nowadays, the need for P2P applications with multidimensional data h ...

Institute of Electrical and Electronics Engineers2009

LSH At Large - Distributed KNN Search in High Dimensions

Karl Aberer, Sebastian Michel, Parisa Haghani

We consider K-Nearest Neighbor search for high dimensional data in large-scale structured Peer-to-Peer networks. We present an efficient mapping scheme based on p-stable Locality Sensitive Hashing to assign hash buckets to peers in a Chord-style overlay ne ...

2008

3D Face Recognition using Sparse Spherical Representations

Pascal Frossard, Effrosyni Kokiopoulou, Ivana Tosic, Roser Sala Llonch

This paper addresses the problem of 3D face recognition using spherical sparse representations. We first propose a fully automated registration process that permits to align the 3D face point clouds. These point clouds are then represented as signals on th ...

2008

Compressive Sensing For Sensor Calibration

Volkan Cevher

We consider a calibration problem, where we determine an unknown sensor location using the known track of a calibration target and a known reference sensor location. We cast the calibration problem as a sparse approximation problem where the unknown sensor ...

2008

Compressive wireless arrays for bearing estimation

Volkan Cevher

Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the slim of the individual sensor processing results. When the sensors have high data sampling rates, arrays are tethered, crea ...

2008

Estimation of the depth of anaesthesia from interacting physiological oscillators

Kumiko Oshima

Nowadays, physiological monitoring is imperative for the safety of medical operations. However, systems which monitor the depth of anaesthesia are still far from reliable, such that still some patients may experience the trauma of remaining conscious under ...

EPFL2008

Hash-and-Sign with Weak Hashing Made Secure

Serge Vaudenay, Sylvain Pasini

Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a weak hash function by a random oracle together with another oracle allowing to break s ...

Springer2007