1154 search results - page 138 / 231 » On the editing distance of graphs |
133
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
167
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
160
click to vote
SMI
2008
IEEE
16 years 21 days ago
2008
IEEE
Hierarchies of patterns of features, of sub-assemblies, or of CSG sub-expressions are used in architectural and mechanical CAD to eliminate laborious repetitions from the design p...
146
click to vote
CVPR
2006
IEEE
16 years 11 days ago
2006
IEEE
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
201
click to vote
IUI
2011
ACM
14 years 9 months ago
2011
ACM
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...