4171 search results - page 387 / 835 » Distributed Data Structure Design for Scientific Computation |
152
click to vote
SIGMOD
1991
ACM
15 years 10 months ago
1991
ACM
In this paper, Dept. of Computer Science, University of Waterloo Waterloo, Ontario, Canada, N2L 3G1 we consider how to exploit multiple disks to improve the performance of B-tree ...
186
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
189
click to vote
MIRAGE
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
165
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
172
click to vote
KAIS
2011
15 years 1 months ago
2011
Recommendation Systems have become an important tool to cope with the information overload problem by acquiring data about the user behavior. After tracing the user behavior, throu...