485 search results - page 67 / 97 » Iterative Bounding LAO |
125
click to vote
JMLR
2010
14 years 5 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
115
Voted
JMLR
2010
14 years 5 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
104
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
81
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
QEST
2008
IEEE
15 years 4 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...