3038 search results - page 218 / 608 » High-Speed Function Approximation |
179
click to vote
COMPUTING
2006
15 years 6 months ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
153
click to vote
TCOM
2008
15 years 6 months ago
2008
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
150
click to vote
TIT
2008
15 years 6 months ago
2008
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
176
click to vote
IR
2010
15 years 5 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
188
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...