15485 search results - page 180 / 3097 » Computing Optimal Subsets |
177
click to vote
IPL
1998
15 years 6 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
152
click to vote
MST
2010
15 years 4 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
190
click to vote
TIT
2011
15 years 1 months ago
2011
—In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the netw...
152
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...
157
click to vote
VL
2007
IEEE
16 years 17 days ago
2007
IEEE
Interval-valued computation is an unconventional computing paradigm. It is an idealization of classical 16-, 32-, 64- etc. bit based computations. It represents data as specific ...