1272 search results - page 230 / 255 » The Set Cover with Pairs Problem |
SDM
2003
SIAM
13 years 11 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
BMCBI
2010
13 years 10 months ago
2010
Background: Analyzing interaction networks for functional characterization poses significant challenges arising from the noisy, incomplete, and generic nature of both the interact...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—We are interested in the sensor networks for scientific applications to cover and measure statistics on the sea surface. Due to flows and waves, the sensor nodes may g...
GI
2003
Springer
14 years 3 months ago
2003
Springer
: The integrated approach for analysis of Large Complex Critical Infrastructures (LCCIs) to afford survivability aimed at preparing a Roadmap for Research and Development for criti...