1088 search results - page 48 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
AAAI
1996
13 years 9 months ago
1996
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competit...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
MP
2010
13 years 6 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
The design of W-operators from a set of input/output examples for large windows is a hard problem. From the statistical standpoint, it is hard because of the large number of examp...