Sciweavers

1498 search results - page 127 / 300
» Collection tree protocol
Sort
View
158
Voted
DMIN
2006
137views Data Mining» more  DMIN 2006»
15 years 6 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
JCB
1998
105views more  JCB 1998»
15 years 4 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
TOIS
2002
97views more  TOIS 2002»
15 years 4 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ICNP
2002
IEEE
15 years 10 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
JFP
2006
113views more  JFP 2006»
15 years 5 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas