472 search results - page 16 / 95 » The Case for Informed Transport Protocols |
STACS
2009
Springer
14 years 5 days ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
— This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase ...
RECONFIG
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Integrated circuits for very high-speed telecommunication protocols often use ASICs, due to their strict timing constraints. This scenario is changing, since modern FPGA...
MM
1996
ACM
13 years 11 months ago
1996
ACM
Such interactive, distributed multimedia applications as shared whiteboards, group editors, and simulations require reliable concurrent multicast services, i.e., the reliable diss...
PRIMA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We have developed a new two-sided matching protocol including job applicants and employers in the condition that applicants have conditional preferences and well informed...