Sciweavers

57 search results - page 2 / 12
» On Tractable Cases of Target Set Selection
Sort
View
BMCBI
2010
132views more  BMCBI 2010»
13 years 4 months ago
Protein network prediction and topological analysis in Leishmania major as a tool for drug target selection
Background: Leishmaniasis is a virulent parasitic infection that causes a worldwide disease burden. Most treatments have toxic side-effects and efficacy has decreased due to the e...
Andrés F. Flórez, Daeui Park, Jong B...
ATAL
2011
Springer
12 years 4 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
DAM
2007
91views more  DAM 2007»
13 years 4 months ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...
ACTA
2006
104views more  ACTA 2006»
13 years 4 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
FCT
2003
Springer
13 years 10 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier