4542 search results - page 718 / 909 » Design patterns for data structures |
136
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
179
click to vote
IM
2007
15 years 6 months ago
2007
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
181
click to vote
TCS
2008
15 years 6 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
171
click to vote
KBS
2007
15 years 6 months ago
2007
The main intent of this paper is to address the issue of middleware in network centric operations. To this end, we characterize a set of Information Technology capabilities that s...
167
click to vote
CSCW
2004
ACM
15 years 6 months ago
2004
ACM
We describe a new collaborative technology that bridges the gap between ad hoc collaboration in email and more formal collaboration in structured shared workspaces. Our approach is...