36 search results - page 4 / 8 » Likelihood Functions and Confidence Bounds for Total-Least-S... |
UAI
2003
13 years 7 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
ICML
2002
IEEE
14 years 6 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
JCM
2007
13 years 5 months ago
2007
— This paper deals with the problem of blind carrier-frequency offset (CFO) estimation in OFDM systems based on offset quadrature amplitude modulation (OFDM/OQAM) with null subca...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...