Sciweavers

2609 search results - page 511 / 522
» Optimizing for parallelism and data locality
Sort
View
FCCM
2002
IEEE
126views VLSI» more  FCCM 2002»
15 years 2 months ago
Hyperspectral Image Compression on Reconfigurable Platforms
NASA’s satellites currently do not make use of advanced image compression techniques during data transmission to earth because of limitations in the available platforms. With th...
Thomas W. Fry, Scott Hauck
BMCBI
2008
214views more  BMCBI 2008»
14 years 10 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
ASPLOS
2011
ACM
14 years 1 months ago
Inter-core prefetching for multicore processors using migrating helper threads
Multicore processors have become ubiquitous in today’s systems, but exploiting the parallelism they offer remains difficult, especially for legacy application and applications ...
Md Kamruzzaman, Steven Swanson, Dean M. Tullsen
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 24 days ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen