1029 search results - page 92 / 206 » Local Minima Embedding |
EJC
2007
15 years 3 months ago
2007
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
135
click to vote
TNN
2010
14 years 9 months ago
2010
A distributed and locally reprogrammable address event receiver has been designed, in which incoming addressevents are monitored simultaneously by all synapses, allowing for arbitr...
149
click to vote
NIPS
2001
15 years 4 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
136
click to vote
NIPS
2003
15 years 4 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...
122
click to vote
PERCOM
2006
ACM
16 years 2 months ago
2006
ACM
Tiny embedded systems have not been an ideal outfit for high performance computing due to their constrained resources. Limitations in processing power, battery life, communication ...