Real datasets are often large enough to necessitate data compression. Traditional `syntactic' data compression methods treat the table as a large byte string and operate at t...
H. V. Jagadish, Raymond T. Ng, Beng Chin Ooi, Anth...
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
Alexei D. Miasnikov, Jayson E. Rome, Robert M. Har...
Existing Full-wave Model Order Reduction (FMOR) approaches are based on Expanded Taylor Series Approximations (ETAS) of the oscillatory full-wave system matrix. The accuracy of su...
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...