Sciweavers

2520 search results - page 61 / 504
» The complexity of approximating entropy
Sort
View
JMLR
2010
106views more  JMLR 2010»
14 years 4 months ago
Improving posterior marginal approximations in latent Gaussian models
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
Botond Cseke, Tom Heskes
JMLR
2006
117views more  JMLR 2006»
14 years 10 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
ISCAS
2007
IEEE
371views Hardware» more  ISCAS 2007»
15 years 4 months ago
FIR Filter Approximation by IIR Filters Based on Discrete-Time Vector Fitting
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
Ngai Wong, Chi-Un Lei
MOBIHOC
2007
ACM
15 years 9 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
INFOCOM
2006
IEEE
15 years 4 months ago
Constant-Complexity Models for Wireless Channels
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
Syed A. Khayam, Hayder Radha