12264 search results - page 2173 / 2453 » Analysis of the rubberband algorithm |
151
click to vote
ICNP
1997
IEEE
15 years 8 months ago
1997
IEEE
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
162
click to vote
SMILE
1998
Springer
15 years 8 months ago
1998
Springer
As virtual worlds demand ever more realistic 3D models, attention is being focussed on systems that can acquire graphical models from real objects. This paper describes a system wh...
138
click to vote
INFOVIS
1997
IEEE
15 years 8 months ago
1997
IEEE
The Bead visualization system employs a fast algorithm for laying out high-dimensional data in a low-dimensional space, and a number of features added to 3D visualizations to impr...
127
click to vote
SIGCSE
1997
ACM
15 years 8 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
122
click to vote
SIGMETRICS
1997
ACM
15 years 8 months ago
1997
ACM
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...