876 search results - page 32 / 176 » New Results for the Martin Polynomial |
AUSAI
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
DISOPT
2008
13 years 8 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
FLAIRS
2003
13 years 10 months ago
2003
This paper presents a number of new algorithms for discovering the Markov Blanket of a target variable T from training data. The Markov Blanket can be used for variable selection ...
AAECC
2000
Springer
13 years 8 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...