4539 search results - page 265 / 908 » Approaches to Compute Workflow Complexity |
209
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
158
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
In this paper, we describe an efficient image-based approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry a...
166
click to vote
CAD
2006
Springer
15 years 6 months ago
2006
Springer
This paper describes an approach to interoperability in design projects that is based on computational agents customizing the representation of product data to individual design to...
183
click to vote
NSDI
2004
15 years 8 months ago
2004
We present a new approach to managing failures and evolution in large, complex distributed systems using runtime paths. We use the paths that requests follow as e through the syst...
164
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...