Sciweavers

989 search results - page 191 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
TSE
2008
165views more  TSE 2008»
13 years 8 months ago
A Systematic Study of Failure Proximity
Software end users are the best testers, who keep revealing bugs in software that has undergone rigorous in-house testing. In order to leverage their testing efforts, failure repor...
Chao Liu 0001, Xiangyu Zhang, Jiawei Han
BMCBI
2006
108views more  BMCBI 2006»
13 years 8 months ago
A new pooling strategy for high-throughput screening: the Shifted Transversal Design
Background: In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and ...
Nicolas Thierry-Mieg
TISSEC
2008
235views more  TISSEC 2008»
13 years 8 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
BMCBI
2011
13 years 3 months ago
NClassG+: A classifier for non-classically secreted Gram-positive bacterial proteins
Background: Most predictive methods currently available for the identification of protein secretion mechanisms have focused on classically secreted proteins. In fact, only two met...
Daniel Restrepo-Montoya, Camilo Pino, Luis F. Ni&n...