4539 search results - page 600 / 908 » Approaches to Compute Workflow Complexity |
178
click to vote
EGC
2005
Springer
16 years 4 days ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
176
click to vote
RT
2005
Springer
16 years 3 days ago
2005
Springer
Image-based representations for illumination can capture complex real-world lighting that is difficult to represent in other forms. Current importance sampling strategies for ima...
175
click to vote
SCALESPACE
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
148
click to vote
EUROPAR
2004
Springer
16 years 7 hour ago
2004
Springer
Abstract. Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many fu...
195
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...