Sciweavers

7259 search results - page 19 / 1452
» From Fields to Trees
Sort
View
IPPS
2003
IEEE
14 years 1 months ago
Design and Evaluation of a Parallel HOP Clustering Algorithm for Cosmological Simulation
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation ...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
LCN
2003
IEEE
14 years 1 months ago
Improving Multicast Tree Construction in Static Ad Hoc Networks
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...
Aleksi Penttinen, Jorma T. Virtamo
IEICET
2008
67views more  IEICET 2008»
13 years 8 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
ICONIP
2007
13 years 9 months ago
Classification of Documents Based on the Structure of Their DOM Trees
In this paper, we discuss kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees in which every node might be la...
Peter Geibel, Olga Pustylnikov, Alexander Mehler, ...
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang