Sciweavers

1039 search results - page 41 / 208
» Kernels and Regularization on Graphs
Sort
View
VLSISP
2002
112views more  VLSISP 2002»
15 years 4 days ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
15 years 6 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert
102
Voted
ICML
2008
IEEE
16 years 1 months ago
Robust matching and recognition using context-dependent kernels
The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to han...
Hichem Sahbi, Jean-Yves Audibert, Jaonary Rabariso...
74
Voted
ICPR
2008
IEEE
15 years 7 months ago
A least square kernel machine with box constraints
In this paper, we present a least square kernel machine with box constraints (LSKMBC). The existing least square machines assume Gaussian hyperpriors and subsequently express the ...
Jayanta Basak
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
16 years 28 days ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen