Sciweavers

5372 search results - page 266 / 1075
» complexity 2007
Sort
View
CORR
2007
Springer
78views Education» more  CORR 2007»
13 years 8 months ago
GLRT-Optimal Noncoherent Lattice Decoding
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...
Daniel J. Ryan, Iain B. Collings, I. Vaughan L. Cl...
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 8 months ago
Computing Minimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
Max Neunhöffer, Cheryl E. Praeger
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 8 months ago
Very fast watermarking by reversible contrast mapping
—Reversible contrast mapping (RCM) is a simple integer transform that applies to pairs of pixels. For some pairs of pixels, RCM is invertible, even if the least significant bits...
Dinu Coltuc, Jean-Marc Chassery
CSDA
2007
134views more  CSDA 2007»
13 years 8 months ago
Variational approximations in Bayesian model selection for finite mixture distributions
Variational methods for model comparison have become popular in the neural computing/machine learning literature. In this paper we explore their application to the Bayesian analys...
Clare A. McGrory, D. M. Titterington
ENDM
2007
68views more  ENDM 2007»
13 years 8 months ago
Detecting induced subgraphs
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
Benjamin Lévêque, David Y. Lin, Fr&ea...