TON
2010
13 years 7 months ago
2010
This paper presents "Self-Chord," a peer-to-peer (P2P) system that inherits the ability of Chord-like structured systems for the construction and maintenance of an overla...
TCS
2011
13 years 7 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
DAC
2009
ACM
13 years 10 months ago
2009
ACM
For hardware security applications, the availability of secret keys is a critical component for secure activation, IC authentication and for other important applications including...
XSYM
2010
Springer
13 years 10 months ago
2010
Springer
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
JPDC
2002
13 years 12 months ago
2002
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
COMAD
2008
14 years 1 months ago
2008
Transformation of a source schema with its conforming data to a target schema with its conforming data is an important activity in XML as two schemas in XML can represent same rea...
BMEI
2008
IEEE
14 years 2 months ago
2008
IEEE
Keys are character based tools for plant identification. They are based on the decomposition of the plant into very small, atomistic parts. These parts are described with the tech...
AAAI
2007
14 years 2 months ago
2007
The practical success of broadcast encryption hinges on the ability to (1) revoke the access of compromised keys and (2) determine which keys have been compromised. In this work w...
CNSR
2004
IEEE
14 years 4 months ago
2004
IEEE
In this paper, we propose a pairing-based signcryption scheme for authenticated broadcasting, which requires less computation than a previously proposed scheme suggesting identity...
SCCC
2002
IEEE
14 years 5 months ago
2002
IEEE
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function from keys to buckets would gi...