Sciweavers

2294 search results - page 113 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ICML
2003
IEEE
15 years 10 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
ECAI
2008
Springer
14 years 11 months ago
Sequential spatial reasoning in images based on pre-attention mechanisms and fuzzy attribute graphs
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics, and graphs...
Geoffroy Fouquier, Jamal Atif, Isabelle Bloch
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 2 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
WADS
2009
Springer
262views Algorithms» more  WADS 2009»
15 years 4 months ago
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
Chenyu Yan, Yang Xiang, Feodor F. Dragan
IWOCA
2010
Springer
240views Algorithms» more  IWOCA 2010»
14 years 4 months ago
Path-Based Supports for Hypergraphs
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, A...