447 search results - page 60 / 90 » Bounded Model Checking with Parametric Data Structures |
JMLR
2006
13 years 7 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— One feature that classification algorithms typically lack is the ability to know what they do not know. With this knowledge an algorithm would be able to operate in any domain...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
UAI
2003
13 years 9 months ago
2003
The Hierarchical Mixture of Experts (HME) is a well-known tree-structured model for regression and classification, based on soft probabilistic splits of the input space. In its o...