Sciweavers

583 search results - page 96 / 117
» Computing Linking Numbers of a Filtration
Sort
View
SIGGRAPH
1991
ACM
14 years 1 months ago
Visibility preprocessing for interactive walkthroughs
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
Seth J. Teller, Carlo H. Séquin
BROADNETS
2007
IEEE
14 years 4 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
TELETRAFFIC
2007
Springer
14 years 4 months ago
Is ALOHA Causing Power Law Delays?
Abstract. Renewed interest in ALOHA-based Medium Access Control (MAC) protocols stems from their proposed applications to wireless ad hoc and sensor networks that require distribut...
Predrag R. Jelenkovic, Jian Tan
FOCS
1997
IEEE
14 years 2 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
PODC
1997
ACM
14 years 2 months ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...