Sciweavers

91 search results - page 4 / 19
» A supertree method for rooted trees
Sort
View
77
Voted
DOCENG
2004
ACM
15 years 5 months ago
Supervised learning for the legacy document conversion
We consider the problem of document conversion from the renderingoriented HTML markup into a semantic-oriented XML annotation defined by user-specific DTDs or XML Schema descrip...
Boris Chidlovskii, Jérôme Fuselier
107
Voted
CVPR
2007
IEEE
16 years 2 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
120
Voted
TKDE
2008
153views more  TKDE 2008»
15 years 7 days 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
118
Voted
ICCSA
2007
Springer
15 years 6 months ago
Tracing Illegal Users of Video: Reconsideration of Tree-Specific and Endbuyer-Specific Methods
In our recent study, we have presented an approach for tracing illegal users in content distribution networks using watermarking and fingerprinting techniques [1][2]. In this paper...
Hyun-Ho Kang, Brian M. Kurkoski, Kazuhiko Yamaguch...
104
Voted
ACL
1996
15 years 1 months ago
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
Richard Sproat, Michael Riley