Sciweavers

1039 search results - page 42 / 208
» Kernels and Regularization on Graphs
Sort
View
113
Voted
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 17 days ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
83
Voted
ML
2007
ACM
15 years 1 days ago
Feature space perspectives for learning the kernel
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
Charles A. Micchelli, Massimiliano Pontil
126
Voted
ICS
2009
Tsinghua U.
15 years 7 months ago
High-performance regular expression scanning on the Cell/B.E. processor
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
Daniele Paolo Scarpazza, Gregory F. Russell
101
Voted
ESANN
2004
15 years 1 months ago
Evolutionary tuning of multiple SVM parameters
The problem of model selection for support vector machines (SVMs) is considered. We propose an evolutionary approach to determine multiple SVM hyperparameters: The covariance matr...
Frauke Friedrichs, Christian Igel
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 10 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...