Sciweavers

CORR
2007
Springer
113views Education» more  CORR 2007»
14 years 15 days 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»
14 years 15 days 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»
14 years 15 days 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»
14 years 15 days 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»
14 years 15 days ago
On the Complexity of the Interlace Polynomial
Markus Bläser, Christian Hoffmann
CORR
2007
Springer
149views Education» more  CORR 2007»
14 years 15 days ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
CORR
2007
Springer
105views Education» more  CORR 2007»
14 years 15 days ago
Embedded Rank Distance Codes for ISI channels
Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time...
Sanket Dusad, Suhas N. Diggavi, A. Robert Calderba...
CORR
2007
Springer
100views Education» more  CORR 2007»
14 years 15 days ago
Unfolding Convex Polyhedra via Quasigeodesics
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...
Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
CORR
2007
Springer
99views Education» more  CORR 2007»
14 years 15 days ago
Services within a busy period of an M/M/1 queue and Dyck paths
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the b...
Moez Draief, Jean Mairesse
CORR
2007
Springer
85views Education» more  CORR 2007»
14 years 15 days ago
Queues, stores, and tableaux
Consider the single-server queue with an infinite buffer and a first-in–first-out discipline,
Moez Draief, Jean Mairesse, Neil O'Connell