Sciweavers

70 search results - page 8 / 14
» Improving locality of nonserial polyadic dynamic programming
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
87
Voted
ISCA
2010
IEEE
236views Hardware» more  ISCA 2010»
15 years 2 months ago
Elastic cooperative caching: an autonomous dynamically adaptive memory hierarchy for chip multiprocessors
Next generation tiled microarchitectures are going to be limited by off-chip misses and by on-chip network usage. Furthermore, these platforms will run an heterogeneous mix of ap...
Enric Herrero, José González, Ramon ...
WOMPAT
2001
Springer
15 years 2 months ago
A Study of Implicit Data Distribution Methods for OpenMP Using the SPEC Benchmarks
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
Dimitrios S. Nikolopoulos, Eduard Ayguadé
ICS
1999
Tsinghua U.
15 years 1 months ago
Eliminating synchronization bottlenecks in object-based programs using adaptive replication
This paper presents a technique, adaptive replication, for automatically eliminating synchronization bottlenecks in multithreaded programs that perform atomic operations on object...
Martin C. Rinard, Pedro C. Diniz
TMI
2002
248views more  TMI 2002»
14 years 9 months ago
Adaptive Elastic Segmentation of Brain MRI via Shape Model Guided Evolutionary Programming
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
Alain Pitiot, Arthur W. Toga, Paul M. Thompson