Sciweavers

6365 search results - page 213 / 1273
» Fast Local Computation Algorithms
Sort
View
ICC
2007
IEEE
105views Communications» more  ICC 2007»
16 years 21 days ago
Phase Noise Suppression for OFDM Systems Over Fast Time-Varying Channels
— This paper derives a phase-noise suppression scheme for orthogonal frequency division multiplexing (OFDM) systems. This scheme is a maximum likelihood approach that exploits th...
O. Can Ozdural, Huaping Liu
CVPR
1999
IEEE
16 years 8 months ago
Fast, Robust, and Consistent Camera Motion Estimation
Previous algorithms that recover camera motion from image velocities sufferfrom both bias and excessive variance in the results. We propose a robust estimator of camera motion tha...
Tong Zhang, Carlo Tomasi
FOCS
2008
IEEE
16 years 25 days ago
Fast Modular Composition in any Characteristic
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
Kiran S. Kedlaya, Christopher Umans
ICDCSW
2008
IEEE
16 years 25 days ago
Fast-Converging Distance Vector Routing for Wireless Mesh Networks
A major concern about distance-vector routing protocols for wireless mesh networks is its slow convergence in the presence of link changes, which can potentially degrade network s...
Yangcheng Huang, Saleem N. Bhatti
ARITH
2007
IEEE
16 years 22 days ago
Fast Modular Reduction
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal