Sciweavers

50 search results - page 4 / 10
» On the Turing Degrees of Divergence Bounded Computable Reals
Sort
View
RECOMB
2005
Springer
15 years 10 months ago
Very Low Power to Detect Asymmetric Divergence of Duplicated Genes
Abstract. Asymmetric functional divergence of paralogues is a key aspect of the traditional model of evolution following duplication. If one gene continues to perform the ancestral...
Cathal Seoighe, Konrad Scheffler
AML
2010
88views more  AML 2010»
14 years 10 months ago
Relativized Schnorr tests with universal behavior
A Schnorr test relative to some oracle A may informally be called "universal" if it covers all Schnorr tests. Since no true universal Schnorr test exists, such an A cann...
Nicholas Rupprecht
JSC
2010
99views more  JSC 2010»
14 years 8 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
IH
2009
Springer
15 years 4 months ago
Estimating Steganographic Fisher Information in Real Images
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
Andrew D. Ker
COMPGEOM
2005
ACM
14 years 11 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...