Sciweavers

1154 search results - page 73 / 231
» On the editing distance of graphs
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
CJCDGCGT
2005
Springer
13 years 12 months ago
Fractional Vertex Arboricity of Graphs
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
Qinglin Yu, Lian-Cui Zuo
SOCIALCOM
2010
13 years 7 months ago
Graph Comparison Using Fine Structure Analysis
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
Owen Macindoe, Whitman Richards
SIBGRAPI
2007
IEEE
14 years 4 months ago
Bipartite graph matching for video clip localization
Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the ma...
Zenilton Kleber G. do Patrocínio Jr., Silvi...
CSCWD
2007
Springer
14 years 4 months ago
An interactive graph visualization for handling cooperative design activity context
The context of a collective activity is characterized by all information produced during the activity. The comprehension of this context by each actor is essential for the success...
Gilles Halin