3415 search results - page 109 / 683 » Lower Bounds for Kernelizations |
97
Voted
NECO
2010
14 years 11 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
100
click to vote
JMLR
2010
14 years 8 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
132
Voted
ALGORITHMICA
2008
15 years 1 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
150
Voted
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
117
Voted
EACL
2006
ACL Anthology
15 years 2 months ago
2006
ACL Anthology
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...