Publications related to Grassmann Hashing For Approximate Nearest Neighbor Search In High Dimensional Space

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.

Another Glance at Double-Length Hashing

Martijn Stam, Onur Özen

We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use on ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

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

Multi-Stream Hashing on the PlayStation 3

Joppe Willem Bos, Dag Arne Osvik, Nathalie Casati

With process technology providing more and more transistors per chip, still following Moore's \law", processor designers have used a number of techniques to make those transistors useful. Lately they have started placing multiple processor cores on each ch ...

Springer2008

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

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

Dimensionality Reduction with Adaptive Approximation

Pascal Frossard, Effrosyni Kokiopoulou

In this paper, we propose the use of (adaptive) nonlinear approximation for dimensionality reduction. In particular, we propose a dimensionality reduction method for learning a parts based representation of signals using redundant dictionaries. A redundant ...

2007

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes alo ...

2007

An Optimal Non-Interactive Message Authentication Protocol

Serge Vaudenay, Sylvain Pasini

Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SAS-based non-interactive message authentication protocols (NIMAP). We start by the analysis of two popular non- ...

Springer2006

Grassmann Hashing For Approximate Nearest Neighbor Search In High Dimensional Space

Graph Chatbot

Chat with Graph Search

Another Glance at Double-Length Hashing

LSH At Large - Distributed KNN Search in High Dimensions

Multi-Stream Hashing on the PlayStation 3

On the estimation of geodesic paths on sampled manifolds after random projections

3D Face Recognition using Sparse Spherical Representations

Hash-and-Sign with Weak Hashing Made Secure

Dimensionality Reduction with Adaptive Approximation

UniStore: Querying a DHT-based Universal Storage

An Optimal Non-Interactive Message Authentication Protocol

VSH, an efficient and provable collision-resistant hash function

UniStore: Querying a DHT-based Universal Storage

LSH At Large - Distributed KNN Search in High Dimensions

3D Face Recognition using Sparse Spherical Representations

VSH, an efficient and provable collision-resistant hash function

Dimensionality Reduction with Adaptive Approximation

An Optimal Non-Interactive Message Authentication Protocol

Another Glance at Double-Length Hashing

On the estimation of geodesic paths on sampled manifolds after random projections

Multi-Stream Hashing on the PlayStation 3

Hash-and-Sign with Weak Hashing Made Secure