Sciweavers

68 search results - page 8 / 14
» Autocorrelations of Random Binary Sequences
Sort
View
NIPS
2003
14 years 11 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
NECO
2010
147views more  NECO 2010»
14 years 8 months ago
Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons
Abstract: Reservoir Computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron which is trained on top of a ...
Lars Büsing, Benjamin Schrauwen, Robert A. Le...
CPAIOR
2010
Springer
15 years 1 months ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
JDA
2010
88views more  JDA 2010»
14 years 8 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
DAGSTUHL
2007
14 years 11 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau