Sciweavers

19 search results - page 2 / 4
» A Survey of the Merit Factor Problem for Binary Sequences
Sort
View
DAM
1999
114views more  DAM 1999»
13 years 5 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
JDA
2010
88views more  JDA 2010»
13 years 4 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...
ICPP
1992
IEEE
13 years 9 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
NIPS
2003
13 years 7 months ago
Online Passive-Aggressive Algorithms
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
Shai Shalev-Shwartz, Koby Crammer, Ofer Dekel, Yor...
TIT
2002
81views more  TIT 2002»
13 years 5 months ago
The decimation-Hadamard transform of two-level autocorrelation sequences
A new method to study and search for two-level autocorrelation sequences for both binary and nonbinary cases is developed. This method iteratively applies two operations: decimatio...
Guang Gong, Solomon W. Golomb