Sciweavers

6306 search results - page 1065 / 1262
» Space, Time, and the Use of Language
Sort
View
CCS
2001
ACM
15 years 11 months ago
Practical forward secure group signature schemes
A group signature scheme allows a group member to sign messages anonymously on behalf of the group, while in case of a dispute, a designated entity can reveal the identity of a si...
Dawn Xiaodong Song
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
15 years 10 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 6 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
SOSP
2009
ACM
16 years 3 months ago
PRES: probabilistic replay with execution sketching on multiprocessors
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...
Soyeon Park, Yuanyuan Zhou, Weiwei Xiong, Zuoning ...
COCOON
1998
Springer
15 years 10 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
« Prev « First page 1065 / 1262 Last » Next »