Sciweavers

1994 search results - page 50 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
14 years 9 months ago
A Few More Cyclic Steiner 2-Designs
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 t 50 using computer programs, which are useful in recursive constructions for cyclic designs....
Kejun Chen, Ruizhong Wei
IEEEPACT
2000
IEEE
15 years 2 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
INFOCOM
2006
IEEE
15 years 3 months ago
GMPLS-Based Dynamic Provisioning and Traffic Engineering of High-Capacity Ethernet Circuits in Hybrid Optical/Packet Networks
- Rapid progress in deployment of national and regional optical network infrastructures holds the promise to provide abundant, inexpensive bandwidth to scientific communities. The ...
Xi Yang, Chris Tracy, Jerry Sobieski, Tom Lehman
ICSE
2004
IEEE-ACM
15 years 9 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
BROADNETS
2006
IEEE
15 years 1 months ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...