4324 search results - page 74 / 865 » A Generalized Representer Theorem |
154
click to vote
JCT
2006
15 years 4 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
128
click to vote
IANDC
2008
15 years 4 months ago
2008
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
134
click to vote
FSS
2010
15 years 1 months ago
2010
: We define compactness for stratified lattice-valued convergence spaces and show that a Tychonoff theorem is true. Further a generalization of the classical Richardson compactific...
134
click to vote
CSFW
2005
IEEE
15 years 9 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
144
click to vote
FCT
1999
Springer
15 years 8 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...