2612 search results - page 207 / 523 » Switching Graphs and Their Complexity |
154
click to vote
NIPS
2003
15 years 5 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
133
click to vote
APPML
2007
15 years 4 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
152
Voted
PDP
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
131
click to vote
GPEM
2007
15 years 4 months ago
2007
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
136
click to vote
TCS
2008
15 years 4 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...