Sciweavers

51 search results - page 1 / 11
» Computational Complexity of Iterated Maps on the Interval
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 3 months ago
Computational Complexity of Iterated Maps on the Interval
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
Christoph Spandl
ICIP
1998
IEEE
14 years 6 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
BMCBI
2007
219views more  BMCBI 2007»
13 years 4 months ago
MetaQTL: a package of new computational methods for the meta-analysis of QTL mapping experiments
Background: Integration of multiple results from Quantitative Trait Loci (QTL) studies is a key point to understand the genetic determinism of complex traits. Up to now many effor...
Jean-Baptiste Veyrieras, Bruno Goffinet, Alain Cha...
DCC
2010
IEEE
13 years 11 months ago
Optimized Analog Mappings for Distributed Source-Channel Coding
This paper focuses on optimal analog mappings for zero-delay, distributed source-channel coding. The objective is to obtain the optimal vector transformations that map between m-d...
Emrah Akyol, Kenneth Rose, Tor A. Ramstad
VTC
2006
IEEE
13 years 10 months ago
Complexity-Reduced Iterative MAP Receiver with Partial Sphere Decoding in Spatial Multiplexing System
– In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system,...
Hyung Ho Park, Tae Young Min, Dong Seung Kwon, Chu...