559 search results - page 27 / 112 » Algorithms and Data Structures for External Memory |
114
click to vote
ICDT
1995
ACM
15 years 5 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
DRM
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
134
click to vote
INFOCOM
2010
IEEE
15 years 8 days ago
2010
IEEE
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
109
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
129
click to vote
EUSFLAT
2009
15 years 4 days ago
2009
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...