Sciweavers

141 search results - page 24 / 29
» The Parallel Iterative Closest Point Algorithm
Sort
View
SIAMSC
2010
198views more  SIAMSC 2010»
13 years 5 months ago
Analysis of Block Parareal Preconditioners for Parabolic Optimal Control Problems
In this paper, we describe block matrix algorithms for the iterative solution of large scale linear-quadratic optimal control problems arising from the optimal control of parabolic...
Tarek P. Mathew, Marcus Sarkis, Christian E. Schae...
CGF
2008
144views more  CGF 2008»
13 years 7 months ago
High Performance GPU-based Proximity Queries using Distance Fields
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...
T. Morvan, M. Reimers, E. Samset
IPPS
2006
IEEE
14 years 1 months ago
Dynamic multi phase scheduling for heterogeneous clusters
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, concurrent programming methods in distributed systems have not been studi...
Florina M. Ciorba, Theodore Andronikos, Ioannis Ri...
PAMI
2007
262views more  PAMI 2007»
13 years 7 months ago
An Efficient Multimodal 2D-3D Hybrid Approach to Automatic Face Recognition
—We present a fully automatic face recognition algorithm and demonstrate its performance on the FRGC v2.0 data. Our algorithm is multimodal (2D and 3D) and performs hybrid (featu...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens
CLUSTER
2002
IEEE
13 years 7 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu