Sciweavers

227 search results - page 16 / 46
» Linearly Parameterized Bandits
Sort
View
NOLISP
2007
Springer
14 years 3 months ago
On the Usefulness of Linear and Nonlinear Prediction Residual Signals for Speaker Recognition
This paper compares the identification rates of a speaker recognition system using several parameterizations, with special emphasis on the residual signal obtained from linear and...
Marcos Faúndez-Zanuy
ACTA
2002
111views more  ACTA 2002»
13 years 9 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
ICML
2009
IEEE
14 years 10 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
PRL
2010
310views more  PRL 2010»
13 years 8 months ago
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
Jean-Philippe Tarel, Pierre Charbonnier
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
14 years 4 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...