4255 search results - page 180 / 851 » Cover |
144
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
107
click to vote
AML
2005
15 years 4 months ago
2005
In this paper, we investigate the extent to which techniques used in [10], [2], and [3] -- developed to prove coloring theorems at successors of singular cardinals of uncountable c...
132
Voted
BIOINFORMATICS
2005
15 years 4 months ago
2005
Motivation: Most of the existing methods in predicting protein subcellular location were used to deal with the cases limited within the scope from two to five localizations, and o...
165
Voted
LOGCOM
2007
15 years 4 months ago
2007
The paper provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. The representation covers in a single framework not only...
118
click to vote
CACM
2004
15 years 4 months ago
2004
We began our analysis of computing research by defining a comprehensive classification system to cover CS, SE, and IS. The classification system and the rationale underlying it ca...