16430 search results - page 213 / 3286 » On Computable Tree Functions |
134
click to vote
ACSC
2002
IEEE
15 years 9 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
128
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
125
click to vote
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
173
click to vote
ICPPW
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes the Multicast Shared Tree Protocol MSTP that has been designed to support the delivery of multicast packets in a mobile ad hoc network. MSTP uses a shared tre...
160
click to vote
ICPP
1993
IEEE
15 years 8 months ago
1993
IEEE
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with fro...