Sciweavers

18572 search results - page 882 / 3715
» High performance C
Sort
View
ICPP
2009
IEEE
16 years 2 months ago
Mapping the FDTD Application to Many-Core Chip Architectures
—This paper reports a study of mapping the Finite Difference Time Domain (FDTD) application to the IBM Cyclops64 (C64) many-core chip architecture [1]. C64 is chosen for this stu...
Daniel Orozco, Guang R. Gao
APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
16 years 2 months ago
Small Clique Detection and Approximate Nash Equilibria
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
Lorenz Minder, Dan Vilenchik
IJCNN
2007
IEEE
16 years 1 months ago
Spectral Clustering of Synchronous Spike Trains
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
António R. C. Paiva, Sudhir Rao, Il Park, J...
HPCC
2007
Springer
16 years 1 months ago
Strategies and Implementation for Translating OpenMP Code for Clusters
OpenMP is a portable shared memory programming interface that promises high programmer productivity for multithreaded applications. It is designed for small and middle sized shared...
Deepak Eachempati, Lei Huang, Barbara M. Chapman
C5
2006
IEEE
16 years 1 months ago
Idioms for Composing Games with EToys
1 Creating one’s own games has been the main motivation for many people to learn programming. But the barrier to learn a general purpose programming language is very high, espec...
Markus Gälli, Oscar Nierstrasz, Serge Stinckw...