4539 search results - page 702 / 908 » Approaches to Compute Workflow Complexity |
199
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This paper addresses a key bottleneck in the use of the 3D medial axis (MA) representation, namely, how the complex MA structure can be regularized so that similar, within-categor...
165
click to vote
CGF
1998
15 years 6 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
136
click to vote
MOC
1998
15 years 6 months ago
1998
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
190
click to vote
IVC
2007
15 years 6 months ago
2007
Conventional Gabor representation and its extracted features often yield a fairly poor performance in retrieving the rotated and scaled versions of the texture image under query. ...
174
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Increasing scale, dynamism, and complexity of hybrid grids make traditional grid resource scheduling approaches difficult. In such grids, where resource volatility and dynamism is...