Sciweavers

469 search results - page 31 / 94
» Directed Graphs of Entanglement Two
Sort
View
AAAI
2006
13 years 9 months ago
Inexact Matching of Ontology Graphs Using Expectation-Maximization
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
Prashant Doshi, Christopher Thomas
GBRPR
2007
Springer
13 years 11 months ago
Image Classification Using Marginalized Kernels for Graphs
We propose in this article an image classification technique based on kernel methods and graphs. Our work explores the possibility of applying marginalized kernels to image process...
Emanuel Aldea, Jamal Atif, Isabelle Bloch
MST
2010
106views more  MST 2010»
13 years 6 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki
SSD
1999
Springer
116views Database» more  SSD 1999»
13 years 12 months ago
Generalizing Graphs Using Amalgamation and Selection
This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying...
John G. Stell, Michael F. Worboys