Sciweavers

4137 search results - page 166 / 828
» On the number of matchings of a tree
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 12 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
TCS
2008
15 years 6 months ago
Optimizing deletion cost for secure multicast key management
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...
Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Ya...
IJCM
2002
92views more  IJCM 2002»
15 years 6 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
SIAMREV
2011
40views more  SIAMREV 2011»
14 years 9 months ago
A Mathematical Model for the Control and Eradication of a Wood Boring Beetle Infestation
We propose a mathematical model for an infestation of a wooded area by a beetle species in which the larvae develop deep in the wood of living trees. Due to the difficulties of det...
Stephen A. Gourley, Xingfu Zou
IPPS
1998
IEEE
15 years 10 months ago
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
Frank Mueller