Finding nearest neighbors in high-dimensional spaces is a fundamental operation in many
diverse application domains. Locality Sensitive Hashing (LSH) is one of the most popular …

Maximum inner product search (MIPS) in high-dimensional spaces has wide applications
but is computationally expensive due to the curse of dimensionality. Existing studies employ …

Locality-sensitive hashing (LSH) and its variants are well-known indexing schemes for
solving the similarity search problem in high-dimensional space. Traditionally, these …

To realize an information-centric networking, IPFS (InterPlanetary File System) generates a
unique ContentID for each content by applying a cryptographic hash to the content itself …

Abstract Ad-hoc Social Networks are formed by groups of nodes, designating a similarity of
interests. The network establishes a two-layer hierarchical structure that comprises …

Abstract Computing Profile Similarity is a fundamental requirement in the area of Social
Networks to suggest similar social connections that have high chance of being accepted as …

Locality-Sensitive Hashing (LSH) and its variants are well-known indexing schemes for
solving the similarity search problem in high-dimensional space. Traditionally, these …

In recent years, the large amount of continuous and heterogeneous datagenerated by the
Internet of Things (IoT) sensors and devices madetheir record and the query search tasks …

In the last 10 years, the rapid development of online social networks has displaced
traditional interpersonal relationships in favor of online communications. When it comes to …

The usage of a subset of observed stars in a CCD image to find their corresponding
matched stars in a stellar catalog is an important issue in astronomical research. Subgraph …