349 search results - page 59 / 70 » The Complexity of Querying External Memory and Streaming Dat... |
GIS
1999
ACM
13 years 12 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
KES
2009
Springer
14 years 7 days ago
2009
Springer
: With the increase in the amount and complexity of information, data warehouse performance has become a constant issue, especially for decision support systems. As decisional expe...
WSCG
2004
13 years 9 months ago
2004
Image-based CSG rendering algorithms for standard graphics hardware rely on multipass rendering that includes reading and writing large amounts of pixel data from and to the frame...
ICDE
2012
IEEE
12 years 7 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
SODA
2010
ACM
14 years 5 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 ...