We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Approximate data matching applications typically use similarity functions to quantify the degree of likeness between two data instances. There are several similarity functions ava...
Carlos A. Heuser, Francisco N. A. Krieser, Viviane...
In this paper, the development of a framework based on the Realtime Database (RTDB) for processing multimodal data is presented. This framework allows readily integration of input...
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...