Sciweavers

11547 search results - page 406 / 2310
» Quantum computing and communication
Sort
View
ICALP
2007
Springer
16 years 29 days ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
ASAP
2005
IEEE
121views Hardware» more  ASAP 2005»
16 years 13 days ago
Using TLM for Exploring Bus-based SoC Communication Architectures
As billion transistor System-on-chips (SoC) become commonplace and design complexity continues to increase, designers are faced with the daunting task of meeting escalating design...
Sudeep Pasricha, Mohamed Ben-Romdhane
ICC
2007
IEEE
15 years 10 months ago
The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment
In our previous work, we proposed a distributed server architecture to deliver multi-party immersive voice communication service to mobile clients (e.g. Sony PSP) accessing a Distr...
Ying Peng Que, Farzad Safaei, Paul Boustead
MMB
2010
Springer
180views Communications» more  MMB 2010»
15 years 8 months ago
ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks
We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may o...
David Hock, Michael Menth, Matthias Hartmann, Chri...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 9 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang