4539 search results - page 364 / 908 » Approaches to Compute Workflow Complexity |
199
click to vote
AGP
1996
IEEE
15 years 11 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
191
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
167
click to vote
USM
2000
15 years 10 months ago
2000
Due to the requirements of open service markets, the structure of networks and application systems is changing. To handle the evolving complex distributed systems, new concepts for...
201
click to vote
ICCV
1995
IEEE
15 years 10 months ago
1995
IEEE
A new information-theoretic approach is presented for finding the pose of an object in an image. The technique does not require information about the surface properties of the ob...
168
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...