Sciweavers

13784 search results - page 109 / 2757
» On Computing Functions with Uncertainty
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 6 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 3 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
BMCBI
2004
207views more  BMCBI 2004»
13 years 8 months ago
Computational identification of transcription factor binding sites by functional analysis of sets of genes sharing overrep-resen
Background: Transcriptional regulation is a key mechanism in the functioning of the cell, and is mostly effected through transcription factors binding to specific recognition moti...
Davide Corà, Ferdinando Di Cunto, Paolo Pro...
STACS
2012
Springer
12 years 4 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
BMCBI
2006
109views more  BMCBI 2006»
13 years 9 months ago
A computational approach to discovering the functions of bacterial phytochromes by analysis of homolog distributions
Background: Phytochromes are photoreceptors, discovered in plants, that control a wide variety of developmental processes. They have also been found in bacteria and fungi, but for...
Tilman Lamparter