3172 search results - page 51 / 635 » On the Random-Self-Reducibility of Complete Sets |
110
Voted
JCO
2007
15 years 18 days ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
88
Voted
JCSS
1998
15 years 11 days ago
1998
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
BILDMED
2007
15 years 2 months ago
2007
This work aims to propose an interactive method for a iconic and textual annotation of digital mammograms. The suggested annotation tool consists of a semantic network to represent...
81
Voted
LREC
2008
15 years 2 months ago
2008
This paper presents the complete and consistent ontological annotation of the nominal part of WordNet. The annotation has been carried out using the semantic features defined in t...
99
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...