Results for:
"
Nir+Alon
" in Documents
- Third Reader Approved by 2006
- Embarking on a PhD project is a remarkable undertaking. This journey was made possible because of the help and guidance of various people. Many individuals have provided advice, encouragement, and sup...
-
Rating:
Views: (1006)
Pages: ()
Uploaded: 13-05-09
- Spectral Sound Gap Filling
- We present a new method for automatically filling in gaps of textural sounds. Our approach is to transform the signal to the time-frequency space, fill in the gap, and apply the inverse transform to r...
-
Rating:
Views: (1006)
Pages: ()
Uploaded: 15-05-09
- Repeated Communication and Ramsey Graphs 1994 19 citations ? 11 self
- We study the savings afforded by repeated use in two zero-error communication problems. Channel coding: We show that some channels can communicate exponentially more bits in two uses than they can in ...
-
Rating:
Views: (1006)
Pages: ()
Uploaded: 13-05-09
- Repeated Communication and Ramsey Graphs 1995 18 citations ? 11 self
- e study the savings afforded by repeated use in two zero-error communication problems. e show that for some random sources, communicating one instance requires arbitrarily-many bits, but communicating...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 15-05-09
- Repeated Communication and Ramsey Graphs 1995 19 citations ? 11 self
- We study the savings afforded by repeated use in two zero-error communication problems. We show that for some random sources, communicating one instance requires arbitrarily-many bits, but communicati...
-
Rating:
Views: (1007)
Pages: ()
Uploaded: 13-05-09
- Repeated Communication and Ramsey Graphs 1994 19 citations ? 11 self
- We study the savings afforded by repeated use in two zero-error communication problems. Channel coding: We show that some channels can communicate exponentially more bits in two uses than they can in ...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09
- Source Coding and Graph Entropies 1995 20 citations ? 0 self
- A sender wants to accurately convey information to a receiver who has some, possibly related, data. We study the expected number of bits the sender must transmit for one and for multiple instances in ...
-
Rating:
Views: (1005)
Pages: ()
Uploaded: 13-05-09
- Repeated communication and Ramsey graphs 1995 19 citations ? 11 self
- We study the savings afforded by repeated use in two zero-error communication problems. We show that for some random sources, communicating one instance requires arbitrarily-many bits, but communicati...
-
Rating:
Views: (1016)
Pages: ()
Uploaded: 08-04-09