Sciweavers

4498 search results - page 311 / 900
» How to Invent Functions
Sort
View
CSC
2009
15 years 6 months ago
Improving Random Walk Performance
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
Ilya Safro, Paul D. Hovland, Jaewook Shin, Michell...
149
Voted
AUTOMATICA
2008
97views more  AUTOMATICA 2008»
15 years 5 months ago
Injectivity analysis using interval analysis: Application to structural identifiability
This paper presents a new numerical algorithm based on interval analysis able to prove that a differentiable function f : A Rn Rn is injective. This algorithm also performs a par...
Sebastien Lagrange, Nicolas Delanoue, Luc Jaulin
BMCBI
2010
94views more  BMCBI 2010»
15 years 5 months ago
A comparative study of conservation and variation scores
Background: Conservation and variation scores are used when evaluating sites in a multiple sequence alignment, in order to identify residues critical for structure or function. A ...
Fredrik Johansson, Hiroyuki Toh
132
Voted
AUTOMATICA
2006
135views more  AUTOMATICA 2006»
15 years 5 months ago
Finite-time convergent gradient flows with applications to network consensus
This paper introduces the normalized and signed gradient dynamical systems associated with a differentiable function. Extending recent results on nonsmooth stability analysis, we ...
Jorge Cortés
CSDA
2006
138views more  CSDA 2006»
15 years 5 months ago
Automatic dimensionality selection from the scree plot via the use of profile likelihood
Most dimension reduction techniques produce ordered coordinates so that only the first few coordinates need be considered in subsequent analyses. The choice of how many coordinate...
Mu Zhu, Ali Ghodsi