15485 search results - page 464 / 3097 » Computing Optimal Subsets |
239
Voted
STOC
2010
ACM
16 years 13 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
177
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Recent studies have shown that the patterns of linkage disequilibrium observed in human populations have a block-like structure, and a small subset of SNPs (called tag...
244
click to vote
KDD
2012
ACM
13 years 10 months ago
2012
ACM
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
219
click to vote
ICDT
2005
ACM
16 years 1 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
243
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...