446 search results - page 44 / 90 » Extremal Stable Graphs |
ICDM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
108
click to vote
IPCO
2008
15 years 1 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Peer-to-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find cont...
109
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...