9532 search results - page 306 / 1907 » Logic, Graphs, and Algorithms |
203
Voted
PAMI
2007
15 years 6 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
179
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
186
click to vote
SIGAL
1990
15 years 10 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
178
click to vote
FCS
2006
15 years 8 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...