Sciweavers

851 search results - page 168 / 171
» Random constructions and density results
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
CCS
2010
ACM
13 years 7 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
BMCBI
2010
133views more  BMCBI 2010»
13 years 7 months ago
Improving de novo sequence assembly using machine learning and comparative genomics for overlap correction
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
Lance E. Palmer, Mathäus Dejori, Randall A. B...
BMCBI
2010
104views more  BMCBI 2010»
13 years 7 months ago
A novel chemogenomics analysis of G protein-coupled receptors (GPCRs) and their ligands: a potential strategy for receptor de-or
Background: G protein-coupled receptors (GPCRs) represent a family of well-characterized drug targets with significant therapeutic value. Phylogenetic classifications may help to ...
Eelke van der Horst, Julio E. Peironcely, Adriaan ...
CN
2006
113views more  CN 2006»
13 years 7 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu