331 search results - page 1 / 67 » Comparing Reductions to NP-Complete Sets |
ECCC
2006
13 years 5 months ago
2006
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
RECOMB
2010
Springer
13 years 3 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
AI
2005
Springer
13 years 11 months ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
KBSE
2007
IEEE
13 years 11 months ago
2007
IEEE
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
CAL
2004
13 years 5 months ago
2004
We compare techniques that dynamically scale the voltage of individual network links to reduce power consumption with an approach in which all links in the network are set to the s...