We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
We propose a flexible approach for the visualization of large, high-dimensional datasets. The raw, highdimensional data is mapped into an abstract 3D distance space using the Fast...
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...