Sciweavers

93 search results - page 15 / 19
» Quadratic Time Algorithms for Finding Common Intervals in Tw...
Sort
View
TSP
2008
173views more  TSP 2008»
13 years 7 months ago
Gaussian Mixture Modeling by Exploiting the Mahalanobis Distance
In this paper, the expectation-maximization (EM) algorithm for Gaussian mixture modeling is improved via three statistical tests. The first test is a multivariate normality criteri...
Dimitrios Ververidis, Constantine Kotropoulos
BMCBI
2007
151views more  BMCBI 2007»
13 years 7 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...
BMCBI
2004
159views more  BMCBI 2004»
13 years 7 months ago
Extractor for ESI quadrupole TOF tandem MS data enabled for high throughput batch processing
Background: Mass spectrometry based proteomics result in huge amounts of data that has to be processed in real time in order to efficiently feed identification algorithms and to e...
Andreas M. Boehm, Robert P. Galvin, Albert Sickman...
ICS
2010
Tsinghua U.
14 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
AMC
2006
104views more  AMC 2006»
13 years 7 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith