3007 search results - page 320 / 602 » Linear Functional Fixed-points |
195
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
175
click to vote
ICANN
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. To generalize the Fisher Discriminant Analysis (FDA) algorithm to the case of discriminant functions belonging to a nonlinear, finite dimensional function space F (Nonli...
184
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
180
click to vote
VISUALIZATION
1997
IEEE
15 years 11 months ago
1997
IEEE
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
179
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...