77 search results - page 4 / 16 » Enumeration Reducibility with Polynomial Time Bounds |
UAI
2004
13 years 8 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
CASC
2007
Springer
14 years 1 months ago
2007
Springer
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...