Publication

Grassmann Hashing For Approximate Nearest Neighbor Search In High Dimensional Space

Related publications (51)

About
Privacy
Disclaimer

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.

Grassmann Hashing For Approximate Nearest Neighbor Search In High Dimensional Space

Graph Chatbot

Chat with Graph Search

Fast Robust PCA on Graphs

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Graph Embedded Nonparametric Mutual Information For Supervised Dimensionality Reduction

Learning Image Descriptors with Boosting

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Laplacian Support Vector Analysis for Subspace Discriminative Learning

High-Dimensional Gaussian Process Bandits

Boosting Binary Keypoint Descriptors

Low-rank Matrix Approximation Using Point-wise Operators

Semi-supervised dimensionality reduction for analyzing high-dimensional data with constraints

Fast Robust PCA on Graphs

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Graph Embedded Nonparametric Mutual Information For Supervised Dimensionality Reduction

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Learning Image Descriptors with Boosting

High-Dimensional Gaussian Process Bandits

Laplacian Support Vector Analysis for Subspace Discriminative Learning

Boosting Binary Keypoint Descriptors

Low-rank Matrix Approximation Using Point-wise Operators

Semi-supervised dimensionality reduction for analyzing high-dimensional data with constraints