Sciweavers

3257 search results - page 338 / 652
» Some Results on Effective Randomness
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 11 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
FLAIRS
2004
15 years 8 months ago
A Method Based on RBF-DDA Neural Networks for Improving Novelty Detection in Time Series
Novelty detection in time series is an important problem with application in different domains such as machine failure detection, fraud detection and auditing. An approach to this...
Adriano L. I. Oliveira, Fernando Buarque de Lima N...
BMCBI
2010
154views more  BMCBI 2010»
15 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...
BMCBI
2008
128views more  BMCBI 2008»
15 years 7 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
BMCBI
2007
109views more  BMCBI 2007»
15 years 7 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....