1154 search results - page 73 / 231 » On the editing distance of graphs |
207
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
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...
182
click to vote
CJCDGCGT
2005
Springer
15 years 8 months ago
2005
Springer
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...
168
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
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...
159
click to vote
SIBGRAPI
2007
IEEE
16 years 1 months ago
2007
IEEE
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...
179
click to vote
CSCWD
2007
Springer
16 years 1 months ago
2007
Springer
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...