Publication

Oblivious Sketching of High-Degree Polynomial Kernels

Publications associées (68)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Automatic Mallampati Classification Using Active Appearance Models

Jean-Philippe Thiran, Matteo Sorci, Anil Yuce, Gabriel Louis Cuendet

Difficult tracheal intubation assessment is an important research topic in anesthesia as failed intubations are important causes of mortality in anesthetic practice. The modified Mallampati score is widely used, alone or in conjunction with other criteria, ...

2012

Comparison-Based Optimizers Need Comparison-Based Surrogates

Ilya Loshchilov

Taking inspiration from approximate ranking, this paper nvestigates the use of rank-based Support Vector Machine as surrogate model within CMA-ES, enforcing the invariance of the approach with respect to monotonous transformations of the fitness function. ...

2010

A Kernel Wrapper for Phoneme Sequence Recognition

We describe a kernel wrapper, a Mercer kernel for the task of phoneme sequence recognition which is based on operations with the Gaussian kernel, and suitable for any sequence kernel classifier. We start by presenting a kernel-based algorithm for phoneme s ...

John Wiley and Sons2009

Informative data: how to get just sufﬁciently rich?

Ljubisa Miskovic

Prediction error identification requires that data be informative with respect to the chosen model structure. Whereas sufficient conditions for informative experiments have been available for a long time, there were surprisingly no results of necessary and ...

IEEE CSS2008

Travel Time Estimation on a Signalised Urban Networks using Cumulative Plots

André-Gilles Dumont, Edward Chung, Ashish Bhaskar

This paper presents the development and testing of a methodology for estimation of average travel time on signalised urban networks. The methodology considers the classical analytical procedure, where average travel time on a study link is estimated as the ...

2007

Methodology for Travel Time Estimation on a Signalised Arterial

André-Gilles Dumont, Edward Chung, Ashish Bhaskar

2007

More Efficiency in Multiple Kernel Learning

An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by \singleemcite{sonnenburg_mkljmlr}. This approach has opened new perspectives since it makes the MKL approach tractable for large-scale problems, by iteratively ...

2007

More Efficiency in Multiple Kernel Learning

IDIAP2007

Influence of lamination parameters on LTCC shrinkage under unconstrained sintering

Peter Ryser, Thomas Maeder, Yannick Sébastien Fournier, Louis-Séverin Bieri

LTCC (Low-Temperature Cofired Ceramic) has attracted considerable interest as a material for sensors and microfluidic circuits, for which dimensional accuracy is essential. The irregular shrinkage behaviour of LTCC tapes must be taken into account when des ...

2006

Conditionally optimal weights of evidence

Stephan Morgenthaler, Robert Staudte

A weight of evidence is a calibrated statistic whose values in [0, 1] indicate the degree of agreement between the data and either of two hypothesis, one being treated as the null (H 0) and the other as the alternative (H 1). A value of zero means perfect ...

Springer-Verlag2005