Sciweavers

2107 search results - page 228 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ARC
2010
Springer
154views Hardware» more  ARC 2010»
13 years 9 months ago
Perspectives on system identification
: System identification is the art and science of building mathematical models of dynamic systems from observed input-output data. It can be seen as the interface between the real ...
Lennart Ljung
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 9 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi
IPL
2006
115views more  IPL 2006»
13 years 9 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
JMLR
2006
124views more  JMLR 2006»
13 years 9 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
MICCAI
2010
Springer
13 years 7 months ago
Sparse Bayesian Learning for Identifying Imaging Biomarkers in AD Prediction
Abstract. We apply sparse Bayesian learning methods, automatic relevance determination (ARD) and predictive ARD (PARD), to Alzheimer’s disease (AD) classification to make accura...
Li Shen, Yuan Qi, Sungeun Kim, Kwangsik Nho, Jing ...