1039 search results - page 72 / 208 » Kernels and Regularization on Graphs |
108
click to vote
IDEAL
2004
Springer
15 years 6 months ago
2004
Springer
Abstract— The paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model gener...
80
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
ICS
2010
Tsinghua U.
15 years 5 months ago
2010
Tsinghua U.
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
85
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
110
click to vote
NJC
2000
15 years 12 days ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...