141 search results - page 28 / 29 » The Parallel Iterative Closest Point Algorithm |
DSS
2006
13 years 5 months ago
2006
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...
CCGRID
2009
IEEE
13 years 6 months ago
2009
IEEE
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
General multi view reconstruction from affine or projective cameras has so far been solved most efficiently using methods of factorizing image data matrices into camera and scene p...
ICS
2005
Tsinghua U.
13 years 11 months ago
2005
Tsinghua U.
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...