Sciweavers

2745 search results - page 244 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
127
Voted
TSP
2008
99views more  TSP 2008»
15 years 4 months ago
Carrier Frequency Offset Mitigation in Asynchronous Cooperative OFDM Transmissions
Carrier frequency offset (CFO) mitigation is critical for orthogonal frequency-division multiplexing (OFDM)-based cooperative transmissions because even small CFO per transmitter m...
Xiaohua Li, Fan Ng, Taewoo Han
CVPR
2008
IEEE
16 years 6 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
127
Voted
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 10 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
BMCBI
2006
116views more  BMCBI 2006»
15 years 4 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
162
Voted
DCOSS
2011
Springer
14 years 4 months ago
A local average consensus algorithm for wireless sensor networks
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...