Sciweavers

5356 search results - page 727 / 1072
» Adventures in time and space
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
COCOON
1998
Springer
15 years 11 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...
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
15 years 11 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
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
ACSAC
2007
IEEE
15 years 10 months ago
Efficient Detection of Delay-Constrained Relay Nodes
Relay nodes are a potential threat to networks since they are used in many malicious situations like stepping stone attacks, botnet communication, peer-to-peer streaming etc. Quic...
Baris Coskun, Nasir D. Memon