Sciweavers

1994 search results - page 51 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
ICPPW
2002
IEEE
15 years 2 months ago
Dynamic Expansion of M : N Protection Groups in GMPLS Optical Networks
Abstract— In order to provide reliable connections across metropolitan and wide-area optical networks, the network operator must provide some degree of redundancy so that traffic...
David W. Griffith, SuKyoung Lee
BROADNETS
2005
IEEE
15 years 3 months ago
Network design for IP-centric light trail networks
Abstract— We explore network design principles for nextgeneration all-optical wide-area networks, employing light-trail technology. Light-trail [1] is a light-wave circuit that a...
Srivatsan Balasubramanian, Ahmed E. Kamal, Arun K....
NETWORKING
2004
14 years 11 months ago
Performance of Wireless Ad Hoc Networks under Balanced Fairness
Balanced fairness is a new resource sharing concept recently introduced by Bonald and Prouti`ere. We extend the use of this notion to wireless networks where the link capacities at...
Aleksi Penttinen, Jorma T. Virtamo
VISUALIZATION
1998
IEEE
15 years 2 months ago
Data level comparison of wind tunnel and computational fluid dynamics data
This paper describes the architecture of a data level comparative visualization system and experiences using it to study computational fluid dynamics data and experimental wind tu...
Qin Shen, Alex Pang, Samuel P. Uselton
ICALP
2003
Springer
15 years 2 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...