Sciweavers

CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 7 months ago
Periodic complementary sets of binary sequences
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
Dragomir Z. Djokovic
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 7 months ago
Tripartitions do not always discriminate phylogenetic networks
Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization, or later...
Gabriel Cardona, Francesc Rosselló, Gabriel...
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 7 months ago
Sequential products in effect categories
Jean-Guillaume Dumas, Dominique Duval, Jean-Claude...
CORR
2007
Springer
73views Education» more  CORR 2007»
13 years 7 months ago
Efficient supervised learning in networks with binary synapses
Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel...
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 7 months ago
Garside monoids vs divisibility monoids
Matthieu Picantin
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
Virtual screening with support vector machines and structure kernels
Support vector machines and kernel methods have recently gained considerable attention in chemoinformatics. They offer generally good performance for problems of supervised classi...
Pierre Mahé, Jean-Philippe Vert
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
Communication under Strong Asynchronism
We consider asynchronous communication over point-to-point discrete memoryless channels without feedback. The transmitter starts sending one block codeword at an instant that is u...
Aslan Tchamkerten, Venkat Chandar, Gregory W. Worn...
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 7 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Gregory Gutin
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
On the Complexity of the Interlace Polynomial
Markus Bläser, Christian Hoffmann