1039 search results - page 44 / 208 » Kernels and Regularization on Graphs |
112
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
106
Voted
EJC
2007
15 years 3 months ago
2007
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
119
Voted
TIP
2008
15 years 3 months ago
2008
We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a...
140
click to vote
SCALESPACE
2007
Springer
15 years 9 months ago
2007
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...
163
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...