124
Voted
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
240
click to vote
ICSAP
2010
15 years 8 months ago
2010
—In this paper, we study the performance of the channel estimation in a Turbo coded, orthogonal frequency division multiplexing (OFDM) with multiple antennas at the receiver. We ...
170
click to vote
ICSAP
2010
15 years 8 months ago
2010
—Image Segmentation is an important and challenging factor in the medical image segmentation. This paper describes segmentation method consisting of two phases. In the first phas...
106
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted ï¬...