8 search results - page 2 / 2 » Tree Spanners for Bipartite Graphs and Probe Interval Graphs |
ORL
2008
13 years 5 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
MLDM
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...