569 search results - page 24 / 114 » Online Bounds for Bayesian Algorithms |
JMLR
2002
14 years 9 months ago
2002
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...
UAI
2004
14 years 11 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
160
click to vote
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...