510 search results - page 15 / 102 » Complexity measures and decision tree complexity: a survey |
FSTTCS
1992
Springer
14 years 16 days ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
WG
1998
Springer
14 years 19 days ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
AUSDM
2008
Springer
13 years 10 months ago
2008
Springer
Accurate and less invasive personalized predictive medicine can spare many breast cancer patients from receiving complex surgical biopsies, unnecessary adjuvant treatments and its...
FLAIRS
2001
13 years 9 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
IJCAI
2003
13 years 9 months ago
2003
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...