Sciweavers

2609 search results - page 31 / 522
» Optimizing for parallelism and data locality
Sort
View
IDA
2003
Springer
15 years 3 months ago
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Peter Merz
MICCAI
2004
Springer
15 years 11 months ago
Parallel Optimization Approaches for Medical Image Registration
Optimization of a similarity metric is an essential component in most medical image registration approaches based on image intensities. The increasing availability of parallel comp...
Mark P. Wachowiak, Terry M. Peters
HPCS
2005
IEEE
15 years 3 months ago
High Performance Derivative-Free Optimization Applied to Biomedical Image Registration
Abstract— Optimization of a similarity metric is an essential component in most medical image registration approaches based on image intensities. In this paper, two new, determin...
Mark P. Wachowiak, Terry M. Peters
CVPR
2012
IEEE
13 years 14 days ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
EUROPAR
2008
Springer
14 years 11 months ago
Deque-Free Work-Optimal Parallel STL Algorithms
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
Daouda Traoré, Jean-Louis Roch, Nicolas Mai...