712 search results - page 104 / 143 » Sorting and selection on dynamic data |
117
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applicati...
102
click to vote
SODA
2010
ACM
15 years 9 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 ...
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
CRV
2006
IEEE
15 years 5 months ago
2006
IEEE
A regularization-based approach to 3-D reconstruction from multiple images is proposed. As one of the most widely used multiple-view 3-D reconstruction algorithms, Space Carving c...
HPDC
2006
IEEE
15 years 5 months ago
2006
IEEE
We develop an adaptive load distribution protocol for logical volume I/O workload in clustered storage systems. It exploits data redundancy among decentralized storage servers to ...