Sciweavers

3495 search results - page 346 / 699
» On the random satisfiable process
Sort
View
WSC
1997
15 years 8 months ago
On the Efficiency of the Splitting and Roulette Approach for Sensitivity Analysis
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
Viatcheslav B. Melas
BIB
2007
108views more  BIB 2007»
15 years 7 months ago
Bayesian methods in bioinformatics and computational systems biology
Bayesian methods are valuable, inter alia, whenever there is a need to extract information from data that is uncertain or subject to any kind of error or noise (including measurem...
Darren J. Wilkinson
BIOSYSTEMS
2008
102views more  BIOSYSTEMS 2008»
15 years 6 months ago
A computational model for telomere-dependent cell-replicative aging
Telomere shortening provides a molecular basis for the Hayflick limit. Recent data suggest that telomere shortening also influence mitotic rate. We propose a stochastic growth mod...
R. D. Portugal, M. G. P. Land, Benar Fux Svaiter
CORR
2011
Springer
148views Education» more  CORR 2011»
15 years 1 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport
COLING
2010
15 years 1 months ago
Incremental Chinese Lexicon Extraction with Minimal Resources on a Domain-Specific Corpus
This article presents an original lexical unit extraction system for Chinese. The method is based on an incremental process driven by an association score featuring a minimal reso...
Gaël Patin