1039 search results - page 114 / 208 » Kernels and Regularization on Graphs |
91
Voted
JGT
2007
15 years 20 days ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
95
Voted
FAC
2002
15 years 17 days ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
116
Voted
JCT
2010
14 years 11 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
78
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
We show how nonlinear embedding algorithms popular for use with shallow semisupervised learning techniques such as kernel methods can be applied to deep multilayer architectures, ...
96
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...