Sciweavers

1228 search results - page 119 / 246
» Continuations, proofs and tests
Sort
View
JUCS
2008
140views more  JUCS 2008»
13 years 8 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 3 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
TCS
2011
13 years 3 months ago
On the relationship between fuzzy and Boolean cellular automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
Heather Betel, Paola Flocchini
BMCBI
2007
140views more  BMCBI 2007»
13 years 8 months ago
From genes to functional classes in the study of biological systems
Background: With the popularisation of high-throughput techniques, the need for procedures that help in the biological interpretation of results has increased enormously. Recently...
Fátima Al-Shahrour, Leonardo Arbiza, Hern&a...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 2 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...