1370 search results - page 35 / 274 » On grids in topological graphs |
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
— We study the evolution of cooperation using the Prisoner’s Dilemma as a metaphor of the tensions between cooperators and non-cooperators, and evolutionary game theory as the ...
JCT
2006
13 years 8 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
SMA
2006
ACM
14 years 2 months ago
2006
ACM
Many applications require the extraction of isolines and isosurfaces from scalar functions defined on regular grids. These scalar functions may have many different origins: from ...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
ESANN
2003
13 years 10 months ago
2003
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...