Sciweavers

1578 search results - page 70 / 316
» Algorithmic randomness of continuous functions
Sort
View
CC
2008
Springer
131views System Software» more  CC 2008»
14 years 10 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
HYBRID
2010
Springer
15 years 4 months ago
A descent algorithm for the optimal control of constrained nonlinear switched dynamical systems
One of the oldest problems in the study of dynamical systems is the calculation of an optimal control. Though the determination of a numerical solution for the general nonconvex o...
Humberto González, Ramanarayan Vasudevan, M...
ICPR
2008
IEEE
15 years 4 months ago
Comparison of Particle Swarm Optimization and Genetic Algorithm for HMM training
Hidden Markov Model (HMM) is the dominant technology in speech recognition. The problem of optimizing model parameters is of great interest to the researchers in this area. The Ba...
Fengqin Yang, Changhai Zhang, Tieli Sun
STACS
2012
Springer
13 years 5 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
IPPS
2007
IEEE
15 years 4 months ago
Library Function Selection in Compiling Octave
One way to address the continuing performance problem of high-level domain-specific languages, such as Octave or MATLAB, is to compile them to a relatively lower level language f...
Daniel McFarlin, Arun Chauhan