Sciweavers

7648 search results - page 167 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
135
Voted
SC
1995
ACM
15 years 6 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard
115
Voted
EVOW
2007
Springer
15 years 8 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
136
Voted
PAMI
2011
14 years 9 months ago
Linear Local Models for Monocular Reconstruction of Deformable Surfaces
—Recovering the 3D shape of a nonrigid surface from a single viewpoint is known to be both ambiguous and challenging. Resolving the ambiguities typically requires prior knowledge...
Mathieu Salzmann, Pascal Fua
136
Voted
BMCBI
2011
14 years 6 months ago
Smith-Waterman Peak Alignment for Comprehensive Two-dimensional Gas Chromatography Mass Spectrometry
Background: Comprehensive two-dimensional gas chromatography coupled with mass spectrometry (GC × GCMS) is a powerful technique which has gained increasing attention over the las...
Seongho Kim, Imhoi Koo, Aiqin Fang, Xiang Zhang
140
Voted
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
15 years 3 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens