Sciweavers

102 search results - page 4 / 21
» Bounded Query Functions with Limited Output Bits
Sort
View
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
13 years 9 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
13 years 9 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan
ECCC
2010
117views more  ECCC 2010»
13 years 6 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
JSAC
2008
159views more  JSAC 2008»
13 years 7 months ago
Limited feedback-based block diagonalization for the MIMO broadcast channel
Block diagonalization is a linear precoding technique for the multiple antenna broadcast (downlink) channel that involves transmission of multiple data streams to each receiver su...
Niranjay Ravindran, Nihar Jindal
DCC
2002
IEEE
14 years 7 months ago
Source Requantization: Successive Degradation and Bit Stealing
We consider source requantization in two forms -- successive degradation (i.e., source fidelity reduction) and bit stealing (i.e., information embedding) -when no forward planning...
Aaron S. Cohen, Stark C. Draper, Emin Martinian, G...