11212 search results - page 186 / 2243 » Semi-persistent Data Structures |
159
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...
156
click to vote
ICLP
1999
Springer
15 years 10 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...
172
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
166
click to vote
WAE
2001
15 years 7 months ago
2001
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
150
click to vote
SSD
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...