559 search results - page 19 / 112 » Algorithms and Data Structures for External Memory |
CPM
2010
Springer
15 years 2 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
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...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...
107
click to vote
TIC
2000
Springer
15 years 1 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
FCCM
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper introduces a parameterisable, application and platform-independent, hybrid memory sub-system for custom hardware. This memory sub-system consists of a scratchpad memory...