Sciweavers

3396 search results - page 102 / 680
» Tree representations of graphs
Sort
View
ICML
2004
IEEE
14 years 2 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
COLT
2010
Springer
13 years 7 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
ASIAMS
2007
IEEE
14 years 3 months ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...
CADE
2001
Springer
14 years 1 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
Aart Middeldorp
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 6 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei