1272 search results - page 43 / 255 » The Set Cover with Pairs Problem |
107
click to vote
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
142
Voted
AAAI
2012
13 years 3 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
89
Voted
JSYML
2008
15 years 20 days ago
2008
Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the inter...
87
Voted
DAM
2008
15 years 24 days ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
104
Voted
BMCBI
2010
15 years 25 days ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...