Sciweavers

156 search results - page 2 / 32
» Random Access to Abstract Data Types
Sort
View
ADAEUROPE
2003
Springer
14 years 20 days ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
CIKM
2007
Springer
14 years 1 months ago
Index compression is good, especially for random access
Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performanc...
Stefan Büttcher, Charles L. A. Clarke
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 7 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
ENTCS
2007
102views more  ENTCS 2007»
13 years 7 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
EUC
2005
Springer
14 years 29 days ago
Access Policy Sheet for Access Control in Fine-Grained XML
Abstract. We propose an access control scheme for developing authorization rules for XML documents, allowing flexible data granularity and authorization propagation. To simplify t...
Jing Wu, Yi Mu, Jennifer Seberry, Chun Ruan