Sciweavers

7015 search results - page 423 / 1403
» Approximation algorithms for co-clustering
Sort
View
CJ
2010
128views more  CJ 2010»
15 years 7 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
CSDA
2006
98views more  CSDA 2006»
15 years 6 months ago
Frequency estimation of undamped exponential signals using genetic algorithms
: In this paper, we consider the problem of frequency estimation of undamped superimposed exponential signals model. We propose two iterative techniques of frequency estimation usi...
Amit Mitra, Debasis Kundu, Gunjan Agrawal
IPL
2010
109views more  IPL 2010»
15 years 1 months ago
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
Akira Ichimura, Maiko Shigeno
172
Voted
ICASSP
2011
IEEE
14 years 10 months ago
A family of algorithms for blind equalization of QAM signals
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which gener...
Joao Mendes Filho, Magno T. M. Silva, Maria D. Mir...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 1 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc