Sciweavers

74 search results - page 7 / 15
» Every Computably Enumerable Random Real Is Provably Computab...
Sort
View
AUTOMATICA
2011
12 years 11 months ago
Fast computation of minimal elementary decompositions of metabolic flux vectors
The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector ca...
Raphaël M. Jungers, Francisca Zamorano, Vince...
MFCS
2009
Springer
14 years 6 days ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
FOCS
2000
IEEE
14 years 1 days 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
ISCAPDCS
2004
13 years 9 months ago
Randomized Sorting on the POPS Network
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
Jaime Davila, Sanguthevar Rajasekaran
AML
2011
177views Mathematics» more  AML 2011»
13 years 2 months ago
A superhigh diamond in the c.e. tt-degrees
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu ...