Back to Results
First PageMeta Content
Artificial intelligence / Nearest neighbor search / Locality-sensitive hashing / IDistance / Randomized algorithm / K-nearest neighbor algorithm / Algorithm / K-d tree / Information science / Mathematics / Search algorithms


SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index Yifang Sun† † Wei Wang†
Add to Reading List

Document Date: 2014-08-12 09:26:02

Open Document

File Size: 693,67 KB

Share Result on Facebook

Company

SUN / Creative Commons / Enron / Intel / /

Currency

pence / /

/

Facility

University of New South Wales / Marsyas library / lxue}@cse.unsw.edu.au Xuemin Lin† University of Technology Sydney / Stable Distribution / /

IndustryTerm

by-product / recent solution / query processing algorithm / query processing / query processing costs / database systems / probabilistic algorithms / important applications / search cost / in-memory processing / data mining / any-time algorithms / This algorithm / basic algorithm / /

MarketIndex

SRS / /

OperatingSystem

Linux / /

Organization

VLDB Endowment / Federal Government / au Xuemin Lin† University of Technology Sydney / University of New South Wales / /

Person

Ying Zhang / Wei Wang / /

Position

Prime Minister / /

Product

SRS-1 / SRS-12 / /

ProgrammingLanguage

C++ / /

ProvinceOrState

Hawaii / /

Region

South Wales / /

Technology

any-time algorithms / This algorithm / randomized algorithm / resulting algorithm / Linux / 2 Let Algorithm / SRS-12 algorithm / C2LSH algorithm / data mining / proposed algorithms / Our SRS-2 algorithm / 5.2 Algorithm / Our SRS-12 algorithm / following algorithms / c-ANN query processing algorithm / four algorithms / pdf / basic algorithm / /

URL

http /

SocialTag