Concept

Multilinear algebra

Related publications (13)

Grassmann Hashing For Approximate Nearest Neighbor Search In High Dimensional Space

Locality-Sensitive Hashing (LSH) approximates nearest neighbors in high dimensions by projecting original data into low-dimensional subspaces. The basic idea is to hash data samples to ensure that the probability of collision is much higher for samples tha ...

Ieee2011

A sufficient condition for computing n-finger force-closure grasps of 3D objects

Sahar El Khoury

We address the problem of computing n-finger force-closure grasps of 3D objects. As 3D force-closure grasps involve 6D wrench space, we use Pl¨ucker coordinates and Grassmann algebra, to demonstrate that wrenches associated to any three non-aligned contact ...

2008

Estimation and control with bounded data uncertainties

Ali H. Sayed

The paper describes estimation and control strategies for models with bounded data uncertainties. We shall refer to them as BDU estimation and BDU control methods, for brevity. They are based on constrained game-type formulations that allow the designer to ...

North-Holland1998

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.