16404 search results - page 863 / 3281 » A set coverage problem |
246
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
259
click to vote
AI
2011
Springer
15 years 2 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
196
click to vote
KDD
2006
ACM
16 years 8 months ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
201
click to vote
IPPS
2005
IEEE
16 years 1 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
215
click to vote
ICALP
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...