Sciweavers

479 search results - page 40 / 96
» Supporting OpenMP on Cell
Sort
View
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 16 days ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
TLCA
2005
Springer
15 years 3 months ago
L3: A Linear Language with Locations
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
Greg Morrisett, Amal J. Ahmed, Matthew Fluet
SWAT
1992
Springer
111views Algorithms» more  SWAT 1992»
15 years 1 months ago
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, ...
CMIG
2010
110views more  CMIG 2010»
14 years 4 months ago
Unsupervised SVM-based gridding for DNA microarray images
This paper presents a novel method for unsupervised DNA microarray gridding based on Support Vector Machines (SVMs). Each spot is a small region on the microarray surface where cha...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
15 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount