LOWER BOUNDS ON LOCALITY SENSITIVE HASHING

Given a metric space $(X,d_X)$, $c \ge 1$, $r > 0$, and $p,q \in [0,1]$, a distribution over mappings $\mathscr{H} : X \to \mathbb{N}$ is called a $(r,cr,p,q)$-sensitive hash family if any two points in $X$ at distance at most $r$ are mapped by $\mathscr{H}$ to the same value with probability at...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on discrete mathematics 2007-01, Vol.21 (4), p.930-935
Hauptverfasser:	MOTWAN, Rajeev, NAOR, Assaf, PANIGRAHY, Rina
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science control theory systems Exact sciences and technology General topology Mathematics Sciences and techniques of general use Theoretical computing Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!