Sciweavers

542 search results - page 39 / 109
» The Denjoy alternative for computable functions
Sort
View
PPL
2010
118views more  PPL 2010»
15 years 4 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
ICRA
2009
IEEE
227views Robotics» more  ICRA 2009»
16 years 25 days ago
Adaptive autonomous control using online value iteration with gaussian processes
— In this paper, we present a novel approach to controlling a robotic system online from scratch based on the reinforcement learning principle. In contrast to other approaches, o...
Axel Rottmann, Wolfram Burgard
COMPGEOM
2005
ACM
15 years 8 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
DATE
2008
IEEE
148views Hardware» more  DATE 2008»
16 years 20 days ago
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
ICIP
2009
IEEE
16 years 7 months ago
Illumination Invariant And Rotational Insensitive Textural Representation
We propose an illumination invariant and rotation insensitive texture representation based on a Markovian textural model. A texture is aligned with its dominant orientation and te...