Sciweavers

1578 search results - page 116 / 316
» Algorithmic randomness of continuous functions
Sort
View
CSREASAM
2006
14 years 11 months ago
A New Robust and Secure Steganographic System for Greyscale Images
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...
Hesham Elzouka
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
15 years 10 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
CIE
2010
Springer
15 years 1 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
BMCBI
2004
323views more  BMCBI 2004»
14 years 9 months ago
Biochemical Network Stochastic Simulator (BioNetS): software for stochastic modeling of biochemical networks
Background: Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true ...
David Adalsteinsson, David McMillen, Timothy C. El...
EOR
2002
125views more  EOR 2002»
14 years 9 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz