285 search results - page 24 / 57 » New Ways to Construct Binary Search Trees |
116
click to vote
IACR
2011
13 years 11 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
ALGORITHMICA
2004
14 years 11 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
89
Voted
ICCSA
2007
Springer
15 years 5 months ago
2007
Springer
An encrypted email is sent from Bob to Alice. A gateway wants to check whether a certain keyword exists in an email or not for some reason (e.g. routing). Nevertheless Alice does n...
EVOW
2008
Springer
15 years 1 months ago
2008
Springer
Nowadays, searching information in the web or in any kind of document collection has become one of the most frequent activities. However, user queries can be formulated in a way th...
105
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...