1651 search results - page 86 / 331 » Measuring the Complexity of Classification Problems |
WG
1998
Springer
14 years 1 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....
BMCBI
2007
13 years 8 months ago
2007
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
To address the problem of algorithm selection for the classification task, we equip a relational case base with new similarity measures that are able to cope with multirelational ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...