Sciweavers

44 search results - page 5 / 9
» The Distance Between Randomly Constructed Genomes
Sort
View
CN
2006
100views more  CN 2006»
13 years 7 months ago
Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds
We consider how to construct and maintain a structured overlay P2P network based on the small-world paradigm. Two main attractive properties of a small-world network are (1) a low...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 7 months ago
The Google Similarity Distance
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
Rudi Cilibrasi, Paul M. B. Vitányi
FOCS
1994
IEEE
13 years 11 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
COMGEO
1999
ACM
13 years 7 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...