Sciweavers

11211 search results - page 2015 / 2243
» Rank-Sensitive Data Structures
Sort
View
SIGCOMM
1997
ACM
15 years 7 months ago
Small Forwarding Tables for Fast Routing Lookups
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...
Mikael Degermark, Andrej Brodnik, Svante Carlsson,...
HPDC
1996
IEEE
15 years 7 months ago
On-Demand Hypermedia/Multimedia Service over Broadband Networks
In this paper we present a uni ed approach for delivering hypermedia/multimedia objects over broadband networks. Documents are stored in various multimedia servers, while the inli...
Christos Bouras, Vaggelis Kapoulas, D. Miras, Vagg...
IPPS
1996
IEEE
15 years 7 months ago
ECO: Efficient Collective Operations for Communication on Heterogeneous Networks
PVM and other distributed computing systems have enabled the use of networks of workstations for parallel computation, but their approach of treating all networks as collections o...
Bruce Lowekamp, Adam Beguelin
122
Voted
VISUALIZATION
1996
IEEE
15 years 7 months ago
Illustrating Transparent Surfaces with Curvature-Directed Strokes
Transparency can be a useful device for simultaneously depicting multiple superimposed layers of information in a single image. However, in computer-generated pictures -as in phot...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer
125
Voted
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 7 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
« Prev « First page 2015 / 2243 Last » Next »