Sciweavers

975 search results - page 147 / 195
» Locality Optimization for Program Instances
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
DPF: A Data Parallel Fortran Benchmark Suite
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
Y. Charlie Hu, S. Lennart Johnsson, Dimitris Kehag...
CP
2006
Springer
14 years 28 days ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
CVPR
2008
IEEE
13 years 11 months ago
A rank constrained continuous formulation of multi-frame multi-target tracking problem
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...
Khurram Shafique, Mun Wai Lee, Niels Haering
VMV
2008
222views Visualization» more  VMV 2008»
13 years 10 months ago
Surface Reconstruction from Fitted Shape Primitives
In this paper we address the problem of reconstructing a structurally simple surface representation from point datasets of scanned scenes as they occur for instance in city scanni...
Philipp Jenke, Bastian Krückeberg, Wolfgang S...
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 9 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet