Sciweavers

316 search results - page 12 / 64
» On the Space Complexity of Randomized Synchronization
Sort
View
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 1 months ago
Semiblind Carrier Frequency Offset Estimation for OFDM Systems
— In this paper we consider the problem of semiblind carrier frequency offset (CFO) estimation for OFDM systems. Specifically, we consider a synchronization scheme based on the ...
Tilde Fusco, Ferdinando Marrone, Mario Tanda
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
14 years 23 days ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
FCS
2006
13 years 8 months ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems
CVPR
2012
IEEE
11 years 9 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik