Sciweavers

1994 search results - page 74 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
ECCV
2006
Springer
15 years 11 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
JUCS
2006
87views more  JUCS 2006»
14 years 9 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
VMV
2008
164views Visualization» more  VMV 2008»
14 years 11 months ago
Vector Glyphs for Surfaces: A Fast and Simple Glyph Placement Algorithm for Adaptive Resolution Meshes
Visualization of flow on boundary surfaces from computational flow dynamics (CFD) is challenging due to the complex, adaptive resolution nature of the meshes used in the modeling ...
Zhenmin Peng, Robert S. Laramee
IPPS
1998
IEEE
15 years 2 months ago
Distributed Dynamic Control of Circuit-Switched Banyan Networks
Circuit-switched Banyan interconnection networks can be built from simple switching elements that do not have logical processing or buffering capabilities. This paper describes a ...
Charles A. Salisbury, Rami G. Melhem

Lecture Notes
443views
16 years 7 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