Sciweavers

5030 search results - page 830 / 1006
» cases 2007
Sort
View
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 6 months 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
96views Education» more  CORR 2007»
15 years 6 months ago
Exact Cover with light
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...
Mihai Oltean, Oana Muntean
CORR
2007
Springer
93views Education» more  CORR 2007»
15 years 6 months ago
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...
Xuancheng Shao, Steven G. Johnson
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 6 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
CORR
2007
Springer
77views Education» more  CORR 2007»
15 years 6 months ago
On the interaction between sharing and linearity
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
Gianluca Amato, Francesca Scozzari