Sciweavers

1154 search results - page 138 / 231
» On the editing distance of graphs
Sort
View
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
13 years 9 months ago
The Swap Edges of a Multiple-Sources Routing Tree
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 ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
13 years 7 months ago
Optimal coverage of a known arbitrary environment
— 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...
Raphael Mannadiar, Ioannis M. Rekleitis
SMI
2008
IEEE
110views Image Analysis» more  SMI 2008»
14 years 3 months ago
OCTOR: OCcurrence selecTOR in pattern hierarchies
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...
Justin Jang, Jarek Rossignac
CVPR
2006
IEEE
14 years 3 months ago
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
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...
Carsten Rother, Thomas P. Minka, Andrew Blake, Vla...
IUI
2011
ACM
12 years 12 months ago
Groups without tears: mining social topologies from email
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...
Diana MacLean, Sudheendra Hangal, Seng Keat Teh, M...