16430 search results - page 12 / 3286 » On Computable Tree Functions |
DC
2007
13 years 7 months ago
2007
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
IPMI
2003
Springer
14 years 8 months ago
2003
Springer
Abstract. A method for quantitative assessment of tree structures is reported allowing evaluation of airway or vascular tree morphology and its associated function. Our skeletoniza...
DM
1999
13 years 7 months ago
1999
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
DEXA
2010
Springer
13 years 7 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...