3096 search results - page 381 / 620 » The Generalized FITC Approximation |
190
click to vote
JMLR
2010
15 years 1 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
191
click to vote
MOC
2010
15 years 1 months ago
2010
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
184
click to vote
SIAMJO
2010
15 years 1 months ago
2010
In this paper, a primal dual method for general possible nonconvex nonlinear optimization problems is considered. The method is an exterior point type method which means that it p...
185
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
This paper deals with error estimates for space-time discretizations in the context of nary variational inequalities of rate-independent type. After introducing a general abstract ...
168
click to vote
SIGMETRICS
2010
ACM
15 years 1 months ago
2010
ACM
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...