1370 search results - page 117 / 274 » On grids in topological graphs |
199
click to vote
CIARP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
176
click to vote
CN
2008
15 years 6 months ago
2008
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
230
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
159
click to vote
ESCIENCE
2007
IEEE
16 years 22 days ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...