Sciweavers

1809 search results - page 28 / 362
» Weakly Computable Real Numbers
Sort
View
ICDCSW
2002
IEEE
14 years 18 days ago
A Demand based Algorithm for Rapid Updating of Replicas
In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algo...
Jesús Acosta-Elías, Leandro Navarro-...
BMCBI
2010
216views more  BMCBI 2010»
13 years 2 months ago
Bayesian Inference of the Number of Factors in Gene-Expression Analysis: Application to Human Virus Challenge Studies
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
Bo Chen, Minhua Chen, John William Paisley, Aimee ...
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
13 years 6 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson
CSL
2005
Springer
14 years 1 months ago
Complexity and Intensionality in a Type-1 Framework for Computable Analysis
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
Branimir Lambov
ISSAC
1992
Springer
95views Mathematics» more  ISSAC 1992»
13 years 11 months ago
Real Algebraic Closure of an Ordered Field: Implementation in Axiom
Real algebraic numbers appear in many Computer Algebra pro bJems. For inst ante the determination of a cylindrical algebraic decomposition for an euclidian space requires compu ti...
Renaud Rioboo