4539 search results - page 46 / 908 » Approaches to Compute Workflow Complexity |
SC
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we propose a new provenance model which is tailored to a class of workflow-based applications. We motivate the approach with use cases from the astronomy community. ...
TVCG
2012
13 years 6 days ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
APL
1998
ACM
15 years 2 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...