Sciweavers

15485 search results - page 464 / 3097
» Computing Optimal Subsets
Sort
View
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 11 months ago
An Improved LP-based Approximation for Steiner Tree
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 ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
BMCBI
2005
67views more  BMCBI 2005»
15 years 6 months ago
Selecting additional tag SNPs for tolerating missing data in genotyping
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...
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
KDD
2012
ACM
166views Data Mining» more  KDD 2012»
13 years 9 months ago
Selecting a characteristic set of reviews
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...
Theodoros Lappas, Mark Crovella, Evimaria Terzi
ICDT
2005
ACM
128views Database» more  ICDT 2005»
16 years 12 days ago
The Pipelined Set Cover Problem
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...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
CORR
2010
Springer
172views Education» more  CORR 2010»
15 years 7 months ago
Seeing Through Black Boxes : Tracking Transactions through Queues under Monitoring Resource Constraints
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...
Animashree Anandkumar, Ting He, Chatschik Bisdikia...