Sciweavers

1039 search results - page 13 / 208
» Kernels and Regularization on Graphs
Sort
View
INFORMATICALT
2000
160views more  INFORMATICALT 2000»
13 years 10 months ago
An Algorithm for Transformation of Finite Automata to Regular Expressions
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
Larisa Stanevichene, Aleksei Vylitok
JMLR
2012
12 years 1 months ago
Algorithms for Learning Kernels Based on Centered Alignment
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh
IJCV
2007
208views more  IJCV 2007»
13 years 10 months ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...
TKDE
2012
198views Formal Methods» more  TKDE 2012»
12 years 1 months ago
Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...
Yiming Zhang, Ling Liu