1039 search results - page 199 / 208 » Kernels and Regularization on Graphs |
102
click to vote
CPC
2010
14 years 6 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
113
click to vote
WINET
2011
14 years 4 months ago
2011
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary mul...
EMNLP
2011
13 years 9 months ago
2011
Class-instance label propagation algorithms have been successfully used to fuse information from multiple sources in order to enrich a set of unlabeled instances with class labels...
KDD
2008
ACM
15 years 9 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...