6833 search results - page 100 / 1367 » Some two-character sets |
113
click to vote
COCO
1991
Springer
15 years 7 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
142
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
155
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
169
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
153
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...