Sciweavers

95 search results - page 2 / 19
» Time and Space Efficient Algorithms for Two-Party Authentica...
Sort
View
ESORICS
2009
Springer
14 years 5 months ago
Authentic Time-Stamps for Archival Storage
Abstract. We study the problem of authenticating the content and creation time of documents generated by an organization and retained in archival storage. Recent regulations (e.g.,...
Alina Oprea, Kevin D. Bowers
RTCSA
2000
IEEE
13 years 8 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas
CCCG
2010
13 years 6 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
13 years 9 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 5 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah