267 search results - page 1 / 54 » Communication Complexity Under Product and Nonproduct Distri... |
CC
2010
Springer
13 years 5 months ago
2010
Springer
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
CORR
2010
Springer
13 years 8 days ago
2010
Springer
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
ECCC
2011
13 years 9 days ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
LREC
2008
13 years 6 months ago
2008
We describe a new multimodal corpus currently under development. The corpus consists of videos of task-oriented dialogues that are annotated for speaker's verbal requests and...