Sciweavers

489 search results - page 47 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 5 months ago
Joint Source and Channel Coding for Image Transmission over Time Varying Channels
—In this paper, the joint source and channel coding for progressive image transmission over channels with varying SNR is considered. Since the feedback of channel status informat...
Lei Cao
PODC
2011
ACM
14 years 1 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
TOG
2012
230views Communications» more  TOG 2012»
13 years 1 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
RTSS
1992
IEEE
15 years 2 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
FOCS
2008
IEEE
15 years 5 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan