4539 search results - page 621 / 908 » Approaches to Compute Workflow Complexity |
201
click to vote
COMPUTING
2008
15 years 6 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
168
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
144
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a mesh with virtual buses as the bandwidth-efficient implementation of the mesh with multiple broadcasting on which many computational problems can be solved w...
202
click to vote
ICPADS
1994
IEEE
15 years 10 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
173
click to vote
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
In the domain of computer vision, there exists a very wide application for the research of human motion capture. This paper proposes a new approach to do motion capture in video. ...