Sciweavers

102 search results - page 10 / 21
» An Improved Zero-One Law for Algorithmically Random Sequence...
Sort
View
BMCBI
2008
136views more  BMCBI 2008»
14 years 9 months ago
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Background: Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utili...
Wah-Heng Lee, Christopher W. Wong, Wan Yee Leong, ...
BMCBI
2010
154views more  BMCBI 2010»
14 years 9 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...
94
Voted
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
15 years 1 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
13 years 9 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
ECCV
2000
Springer
15 years 11 months ago
Quasi-Random Sampling for Condensation
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
Vasanth Philomin, Ramani Duraiswami, Larry S. Davi...