Sciweavers

2520 search results - page 245 / 504
» The complexity of approximating entropy
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
ICDCS
2010
IEEE
15 years 10 months ago
Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
BMCBI
2007
169views more  BMCBI 2007»
15 years 6 months ago
Transcriptional regulatory network refinement and quantification through kinetic modeling, gene expression microarray data and i
Background: Gene expression microarray and other multiplex data hold promise for addressing the challenges of cellular complexity, refined diagnoses and the discovery of well-targ...
Abdallah Sayyed-Ahmad, Kagan Tuncay, Peter J. Orto...
BMCBI
2006
172views more  BMCBI 2006»
15 years 6 months ago
A novel scoring schema for peptide identification by searching protein sequence databases using tandem mass spectrometry data
Background: Tandem mass spectrometry (MS/MS) is a powerful tool for protein identification. Although great efforts have been made in scoring the correlation between tandem mass sp...
Zhuo Zhang, Shiwei Sun, Xiaopeng Zhu, Suhua Chang,...
BMCBI
2006
116views more  BMCBI 2006»
15 years 6 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...