Web Results

en.wikipedia.org/wiki/Locality-sensitive_hashing

Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data. .... A locality-preserving hashing is a hash function f that maps a point or points in ... between of the output hash values; input values that are closer to each other .... Define the function family H to be the set of all such functions and let D be ...

iopscience.iop.org/article/10.1088/1742-6596/930/1/012012/pdf

Technique in Closed Hash Searching Process. To cite this article: Robbi Rahim et al 2017 J. Phys. .... be done sequentially or using the new Hash function.

15721.courses.cs.cmu.edu/spring2017/papers/19-sortmergejoins/graefe-tkde1994.pdf

GRAEFE et al.: SORT VS. HASH REVISITED. 935. Fig. 1. Naive merging. Fig. 2. ..... port a simple open-next-close protocol similar to conventional file scans.

arxiv.org/pdf/1509.05472

Sep 17, 2015 ... data distributions or class labels when optimizing the hash codes or functions. ..... order to improve precision as well as recall, Xu et al., de- veloped multiple ..... similar or closer to a query point q than the point xэ, as demon-.

www.ee.ucl.ac.uk/~ipsaras/files/hash-route-clustering-comnet-2016.pdf

Hash-routing is a well-known technique used in server-cluster environments to ... V. Sourlas et al. ..... The closed form formula in [48] can only be used in the ex-.

alex.smola.org/papers/2009/Weinbergeretal09.pdf

sands of users collectively label emails as spam or not- spam, and each user ... the bias inherent in the hash kernel of (Shi et al., 2009). In a multi-task setting, we  ...

www.aclweb.org/anthology/P08-1058

hash function generated at random (Majewski et al., ... neural networks) or to reduce the model size directly ..... for bigrams are close to their expected values.

people.csail.mit.edu/jshun/hash.pdf

Permission to make digital or hard copies of all or part of this work for personal or classroom use is ... concurrent open addressing [15] and closed addressing [20] hash .... hash table of Fan et al. supports concurrent access by multiple read-.

www.akamai.com/es/es/multimedia/documents/technical-publication/consistent-hashing-and-random-trees-distributed-caching-protocols-for-relieving-hot-spots-on-the-world-wide-web-technical-publication.pdf

that can be used to decrease or eliminate the occurrence of hot spots in the network. .... Like Chankhunthod et al., we use a tree of caches to coalesce re- quests. ...... are browsers that are not close to any cache, and where there are clusters in ...