1039 search results - page 43 / 208 » Kernels and Regularization on Graphs |
105
click to vote
CVIU
2007
15 years 15 days ago
2007
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
116
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present a novel semisupervised regression algorithm working on multiclass data that may lie on multiple manifolds. Unlike conventional manifold regression algori...
136
click to vote
ALGORITHMICA
2002
15 years 12 days ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
CORR
2008
Springer
15 years 18 days ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
CORR
2008
Springer
15 years 18 days ago
2008
Springer
We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C n log n.