4541 search results - page 42 / 909 » Cache-Oblivious Algorithms and Data Structures |
ML
2007
ACM
14 years 10 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
DRM
2007
Springer
15 years 5 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...
100
click to vote
CIKM
1999
Springer
15 years 3 months ago
1999
Springer
A considerable amount of clean semistructured data is internally available to companies in the form of business reports. However, business reports are untapped for data mining, da...
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
165
Voted
POPL
2008
ACM
15 years 11 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...