Sciweavers

72 search results - page 9 / 15
» Computing homotopic shortest paths efficiently
Sort
View
OSN
2008
83views more  OSN 2008»
13 years 7 months ago
Path selection in user-controlled circuit-switched optical networks
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
Wojciech M. Golab, Raouf Boutaba
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
13 years 11 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
CVPR
1996
IEEE
13 years 11 months ago
Global Minimum for Active Contour Models: A Minimal Path Approach
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model's energy between two end points. Initialization is ...
Laurent D. Cohen, Ron Kimmel
STACS
2000
Springer
13 years 11 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount