1370 search results - page 44 / 274 » On grids in topological graphs |
COLT
1993
Springer
14 years 1 months ago
1993
Springer
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
DAGM
2003
Springer
14 years 3 months ago
2003
Springer
We define strong r-similarity and the morphing distance to bound geometric distortions between shapes of equal topology. We then derive a necessary and sufficient condition for a ...
IJON
2010
13 years 8 months ago
2010
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
COMPUTING
1999
13 years 9 months ago
1999
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...