18 search results - page 4 / 4 » Alphabet Partitioning for Compressed Rank Select and Applica... |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
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 ...
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...