4616 search results - page 596 / 924 » The Communication Complexity of Correlation |
186
click to vote
ISSS
1996
IEEE
15 years 11 months ago
1996
IEEE
Traditionally, application specific computations have been focusing on numerically intensive data manipulation. Modern communications and DSP applications, such as WWW, interactiv...
191
click to vote
SIGCOMM
1996
ACM
15 years 11 months ago
1996
ACM
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
211
click to vote
SIGCOMM
1996
ACM
15 years 11 months ago
1996
ACM
Wormhole routing LANs are emerging as an effective solution for high-bandwidth, low-latency interconnects in distributed computing and cluster computing applications. An important...
188
click to vote
INFOCOM
1994
IEEE
15 years 11 months ago
1994
IEEE
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
212
click to vote
ISN
1994
Springer
15 years 11 months ago
1994
Springer
There is a common unjustified belief that OSI management technology, despite being very powerful, is difficult to implement because of the complexity of the underlying service/prot...