4539 search results - page 176 / 908 » Approaches to Compute Workflow Complexity |
107
click to vote
PLDI
2010
ACM
15 years 9 months ago
2010
ACM
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
106
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
153
click to vote
CGF
2008
15 years 4 months ago
2008
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
147
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
129
click to vote
IEEESCC
2008
IEEE
15 years 10 months ago
2008
IEEE
Service-orientation enables cooperation between multiple organizations and has become a solution of choice to tackle the complexity of ubiquitous computing. The very nature of ubi...