Sciweavers

742 search results - page 73 / 149
» Classical conditioning
Sort
View
LPAR
2010
Springer
13 years 7 months ago
Polite Theories Revisited
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
Dejan Jovanovic, Clark Barrett
PAMI
2010
132views more  PAMI 2010»
13 years 7 months ago
Maximum Likelihood Model Selection for 1-Norm Soft Margin SVMs with Multiple Parameters
—Adapting the hyperparameters of support vector machines (SVMs) is a challenging model selection problem, especially when flexible kernels are to be adapted and data are scarce....
Tobias Glasmachers, Christian Igel
PTS
2010
140views Hardware» more  PTS 2010»
13 years 7 months ago
More Testable Properties
In this paper, we explore the set of testable properties within the Safety-Progress classification where testability means to establish by testing that a relation, between the tes...
Yliès Falcone, Jean-Claude Fernandez, Thier...
SIAMSC
2010
160views more  SIAMSC 2010»
13 years 7 months ago
Shift-Invert Arnoldi Approximation to the Toeplitz Matrix Exponential
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and...
Spike T. Lee, Hong-Kui Pang, Hai-Wei Sun
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
13 years 7 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...