2657 search results - page 23 / 532 » On the complexity of hierarchical problem solving |
ICDAR
2005
IEEE
15 years 3 months ago
2005
IEEE
A binary hierarchical classifier is proposed to solve the multi-class classification problem. We also require rejection of non-target inputs, which thus producing a very difficult...
70
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Grid computing allows the utilization of vast computational resources for solving complex scientific and engineering problems. However, development tools for Grid applications are...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
89
Voted
SIGAL
1990
15 years 1 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
SSWMC
2004
14 years 11 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...