Sciweavers

10899 search results - page 40 / 2180
» Wide Area Computation
Sort
View
ICIP
2001
IEEE
16 years 5 months ago
Fast computation of morphological area pattern spectra
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tar...
Arnold Meijster, Michael H. F. Wilkinson
PAMI
2011
14 years 10 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih
SIGGRAPH
1992
ACM
15 years 7 months ago
Computing the antipenumbra of an area light source
We define the antiumbra and the antipenumbra of a convex area light source shining through a sequence of convex areal holes in three dimensions. The antiumbra is the volume from w...
Seth J. Teller
130
Voted
TE
2010
104views more  TE 2010»
14 years 10 months ago
Integrating Asynchronous Digital Design Into the Computer Engineering Curriculum
Abstract--As demand increases for circuits with higher performance, higher complexity, and decreased feature size, asynchronous (clockless) paradigms will become more widely used i...
Scott C. Smith, Waleed Al-Assadi, Jia Di
CGVR
2006
15 years 5 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger