125 search results - page 17 / 25 » Deriving Explicit Data Links in WS-BPEL Processes |
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
101
click to vote
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
A new coordination language for distributed data-parallel programs is presented, call SNet. The intention of SNet is to introduce advanced structuring techniques into a coordinatio...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper proposes a new registration algorithm, Covariance Driven Correspondences (CDC), that depends fundamentally on the estimation of uncertainty in point correspondences. Th...
CIBCB
2007
IEEE
15 years 3 months ago
2007
IEEE
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
Usually, the functionality of a module of co-expressed genes is derived from enrichment within the module of a particular gene annotation category. The systematic setup of the che...