Sciweavers

1091 search results - page 111 / 219
» Approximation in Databases
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 8 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
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 ...
Jia Pan, Dinesh Manocha
ER
2007
Springer
279views Database» more  ER 2007»
16 years 14 days ago
SimEval - A Tool for Evaluating the Quality of Similarity Functions
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...
ICMCS
2009
IEEE
108views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Multimodal data communication for human-robot interactions
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...
Frank Wallhoff, Tobias Rehrl, Jürgen Gast, Al...
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
16 years 6 months ago
Hypergraph spectral learning for multi-label classification
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...
Liang Sun, Shuiwang Ji, Jieping Ye
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
16 years 6 months ago
Toward best-effort information extraction
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...