Sciweavers

28888 search results - page 69 / 5778
» Computability and complexity in analysis
Sort
View
ICC
2008
IEEE
145views Communications» more  ICC 2008»
14 years 2 months ago
A Low-Complexity Synchronization Design for MB-OFDM Ultra-Wideband Systems
In this paper, we investigate the low-complexity synchronization design for multi-band orthogonalfrequency-division-multiplexing (MB-OFDM) ultra-wideband (UWB) systems. We propose...
Zhenzhen Ye, Chunjie Duan, Philip V. Orlik, Jinyun...
ICPR
2008
IEEE
14 years 9 months ago
Force histograms computed in O(NlogN)
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
JingBo Ni, Pascal Matsakis
IPPS
2003
IEEE
14 years 1 months ago
Parallelisation of IBD Computation for Determining Genetic Disease Map
A number of software packages are available for the construction of comprehensive human genetic maps. In this paper we parallelize the widely used package Genehunter. We restrict ...
Nouhad J. Rizk
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
13 years 9 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert