Sciweavers

971 search results - page 30 / 195
» Comparative Analysis of Arithmetic Coding Computational Comp...
Sort
View
FOSSACS
2010
Springer
14 years 2 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
ICPR
2006
IEEE
14 years 9 months ago
Component Analysis of Torah Code Phrases
In this paper, we develop a new tool, called Component Analysis (CA), to study the significance of long Torah Code phrases. CA quantifies the relevance of such a phrase, by compar...
Art Levitt
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
14 years 2 months ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
GLOBECOM
2008
IEEE
14 years 2 months ago
Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
Feifei Gao, Arumugam Nallanathan, Chintha Tellambu...
VLSID
2004
IEEE
209views VLSI» more  VLSID 2004»
14 years 8 months ago
An Architecture for Motion Estimation in the Transform Domain
demanding algorithm of a video encoder. It is known that about 60% ~ 80% of the total computation time is consumed for motion estimation [1]. The second is its high impact on the v...
J. Lee, Narayanan Vijaykrishnan, Mary Jane Irwin, ...