Sciweavers

CORR
2007
Springer
80views Education» more  CORR 2007»
13 years 7 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 7 months ago
Hadwiger and Helly-type theorems for disjoint unit spheres
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Syl...
CORR
2007
Springer
107views Education» more  CORR 2007»
13 years 7 months ago
Bounds on ordered codes and orthogonal arrays
— We prove several new bounds on ordered codes and ordered orthogonal arrays. We also show that the eigenvalues of the ordered Hamming scheme are the multivariable Krawtchouk pol...
Alexander Barg, Punarbasu Purkayastha
CORR
2007
Springer
63views Education» more  CORR 2007»
13 years 7 months ago
Optimizing the SINR operating point of spatial networks
— This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and ...
Nihar Jindal, Jeffrey G. Andrews, Steven Weber
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 months ago
Uniform and Partially Uniform Redistribution Rules
Abstract - This short paper introduces two new fusion rules for combining quantitative basic belief assignments. These rules although very simple have not been proposed in literatu...
Florentin Smarandache, Jean Dezert
CORR
2007
Springer
194views Education» more  CORR 2007»
13 years 7 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
CORR
2007
Springer
107views Education» more  CORR 2007»
13 years 7 months ago
High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras
It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are singlesymbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-sy...
Sanjay Karmakar, B. Sundar Rajan
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 7 months ago
Estimation of the Rate-Distortion Function
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...
Matthew T. Harrison, Ioannis Kontoyiannis
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 7 months ago
A multivariate interlace polynomial
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
Bruno Courcelle