Sciweavers

16404 search results - page 584 / 3281
» A set coverage problem
Sort
View
BMCBI
2007
114views more  BMCBI 2007»
15 years 7 months ago
Probabilistic prediction and ranking of human protein-protein interactions
Background: Although the prediction of protein-protein interactions has been extensively investigated for yeast, few such datasets exist for the far larger proteome in human. Furt...
Michelle S. Scott, Geoffrey J. Barton
JILP
2000
165views more  JILP 2000»
15 years 6 months ago
BMAT - A Binary Matching Tool for Stale Profile Propagation
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...
Zheng Wang, Ken Pierce, Scott McFarling
TPDS
2010
159views more  TPDS 2010»
15 years 5 months ago
Exploring In-Situ Sensing Irregularity in Wireless Sensor Networks
The circular sensing model has been widely used to estimate performance of sensing applications in existing analysis and simulations. While this model provides valuable high-level...
Joengmin Hwang, Tian He, Yongdae Kim
CANDC
2006
ACM
15 years 7 months ago
Detecting and aligning peaks in mass spectrometry data with applications to MALDI
In this paper, we address the peak detection and alignment problem in the analysis of mass spectrometry data. To deal with the peak redundancy problem existing in the MALDI data a...
Weichuan Yu, Baolin Wu, Ning Lin, Kathy Stone, Ken...
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
16 years 7 months ago
The importance of being biased
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
Irit Dinur, Shmuel Safra