317 search results - page 5 / 64 » Computing and Updating the Process Number in Trees |
ESORICS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
TCS
2008
13 years 7 months ago
2008
Multicast and broadcast are efficient ways to deliver messages to a group of recipients in a network. Due to the growing security concerns in various applications, messages are oft...
ESA
2003
Springer
14 years 25 days ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
This paper investigates a class of transform queries proposed by XQuery Update [6]. A transform query is defined in terms of XML update syntax. When posed on an XML tree T, it ret...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...