Sciweavers

1093 search results - page 39 / 219
» Fast Abstracts
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 28 days ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
AMCP
1998
Springer
236views Multimedia» more  AMCP 1998»
13 years 12 months ago
InvenTcl: A Fast Prototyping Environment for 3D Graphics and Multimedia Applications
Abstract. This paper describes InvenTcl which is an interpretive version of Open Inventor, a 3D graphics toolkit. To create InvenTcl, the Open Inventor toolkit is \wrapped" in...
Sidney Fels, Kenji Mase
ICALP
1992
Springer
13 years 11 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
ICC
2007
IEEE
150views Communications» more  ICC 2007»
13 years 11 months ago
Fast Proactive Recovery from Concurrent Failures
Abstract-- Recovery of traffic in connectionless pure IP networks has traditionally been handled by a full re-convergence of the network state. This process operates in a time scal...
Audun Fosselie Hansen, Olav Lysne, Tarik Cicic, St...
SIGCOMM
2000
ACM
13 years 11 months ago
Memory-efficient state lookups with fast updates
Routers must do a best matching pre x lookup for every packet solutions for Gigabit speeds are well known. As Internet link speeds higher, we seek a scalable solution whose speed ...
Sandeep Sikka, George Varghese