Sciweavers

226 search results - page 27 / 46
» More Legal Transformations for Locality
Sort
View
IPPS
1998
IEEE
15 years 4 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
CLUSTER
2004
IEEE
15 years 3 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
CORR
2010
Springer
48views Education» more  CORR 2010»
14 years 12 months ago
Stochastic Flips on Two-letter Words
This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing flips, a local transformation whi...
Olivier Bodini, Thomas Fernique, Damien Regnault
IJRR
2006
116views more  IJRR 2006»
14 years 11 months ago
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
Sebastian Thrun, Michael Montemerlo
TCBB
2008
107views more  TCBB 2008»
14 years 11 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...