11784 search results - page 443 / 2357 » Interpolation for data structures |
178
click to vote
ADBIS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
172
click to vote
ECCC
2007
15 years 6 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
194
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
182
click to vote
COMPGEOM
1999
ACM
15 years 11 months ago
1999
ACM
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
169
click to vote
ICLP
1999
Springer
15 years 11 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...